Submission #1518409

---

Source Code Expand

#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>

using namespace std;

#ifndef _DEBUG
#define main_ main
#endif
#define FOR(i,s,e) for (int i = int(s); i < int(e); ++i)
#define REP(i,e) FOR(i,0,e)
#define INF (INT_MAX/2)
#define EPS (1.0e-8)
#define LINF (LONG_MAX/2)

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<string> vs;

template <typename T>
using keyVal = pair<string, T>;
template<typename T>
bool val_greater(const keyVal<T>& left, const keyVal<T>& right) {
	return left.second > right.second;
}

vs split(string str, char sep) {
	vs v; stringstream ss(str); string t;
	while (getline(ss, t, sep)) v.push_back(t);
	return v;
}

void init_global() {}

int main_() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N,M;  cin >> N>>M;
	vvi R(N, vi(N, 0));

	FOR(i, 0, M) {
		int A, B; cin >> A >> B;
		A--; B--;
		R[A][B] = R[B][A] = 1;
	}

	FOR(i, 0, N) {
		FOR(j, 0, N) {
			if (j == i)continue;
			
			if (R[i][j] == 1) {
				FOR(k, 0, N) {
					if (k == j || k == i) continue;

					if (R[j][k] == 1 && R[i][k] != 1) {
						R[i][k] = 2;
						R[k][i] = 2;
					}
				}
			}
		}
	}

	FOR(i, 0, N) {
		int ff = 0;
		FOR(j, 0, N) {
			if (R[i][j] == 2) ff++;
		}
		cout << ff << endl;
	}

	return 0;
}

Submission Info

Judge Result