Submission #1195006

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define REEP(i, N) for(ll i = N - 1; i >= 0; --i)
#define FOR(i,m,n) for(ll i = m; i < n; ++i)
#define RFOR(i,m,n) for(ll i = n - 1; i >= m; --i)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define PB push_back
#define KIRIAGE(a, b) a += (b - a % b) % b // a を b の倍数値まで増やす
#define CEIL(c, a, b) if(a % b == 0) { c = a / b;} else { c = a / b + 1;} // a / b 以上の最小整数
#define sp(n) setprecision(n)
#define INF 1000000000
#define MOD 1000000007

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, 1, 0, -1};
int dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};



vector<vector<int>> g;
vector<int> c;
vector<bool> det;
int d;

void dfs(int roc, int n, int co) {
	c[roc] = co;
	if(n == d) return;
	else {
		REP(i, g[roc].size()) {
			if(!det[g[roc][i]]) {
				det[g[roc][i]] = true;
				dfs(g[roc][i], n + 1, co);
			    det[g[roc][i]] = false;
			}
		}
	}
}

int main(void) {
	int N, M;
	cin>>N>>M;
	g.resize(N);
	c.resize(N);
	det.resize(N);
	REP(i, N) c[i] = 0;
	REP(i, M) {
		int a, b;
		cin>>a>>b;
		--a;
		--b;
		g[a].pb(b);
		g[b].pb(a);
	}
	int Q;
	cin>>Q;
	REP(i, Q) {
		int v, c;
		cin>>v>>d>>c;
		--v;
		dfs(v, 0, c);
	}
	REP(i, N) cout<<c[i]<<endl;
}

Submission Info

Judge Result