Submission #1502709


Source Code Expand

#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;
const int MAX_N = 1e5+10;
vector<int> es[MAX_N];

int color[MAX_N];
bool used[MAX_N][11];

void dfs(int cur, int par, int d, int c) {
	if(used[cur][d]) return;
	used[cur][d] = true;
	if(!color[cur]) color[cur] = c;
	if(d == 0) return;
	for(auto& to : es[cur]) {
		if(to == par) continue;
		dfs(to, cur, d-1, c);
	}
}

int main(){
	int n, m;
	cin >> n >> m;
	rep(i, m) {
		int a, b;
		cin >> a >> b;
		a--; b--;
		es[a].pb(b);
		es[b].pb(a);
	}
	int q;
	cin >> q;
	vi d(q), v(q), c(q);
	rep(i, q) cin >> v[i] >> d[i] >> c[i];
	repr(i, q) dfs(v[i]-1, -1, d[i], c[i]);
	rep(i, n) cout << color[i] << endl; 
	return 0;
}

Submission Info

Submission Time
Task B - Splatter Painting
User T1610
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1216 Byte
Status AC
Exec Time 332 ms
Memory 9080 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 500 / 500
Status
AC × 2
AC × 19
AC × 35
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
Subtask1 00_example_01.txt, 00_example_02.txt, 10_01.txt, 10_02.txt, 10_03.txt, 10_04.txt, 10_05.txt, 10_06.txt, 10_07.txt, 10_08.txt, 10_09.txt, 10_10.txt, 10_11.txt, 10_12.txt, 10_13.txt, 10_14.txt, 10_15.txt, 10_16.txt, 10_17.txt
All 00_example_01.txt, 00_example_02.txt, 10_01.txt, 10_02.txt, 10_03.txt, 10_04.txt, 10_05.txt, 10_06.txt, 10_07.txt, 10_08.txt, 10_09.txt, 10_10.txt, 10_11.txt, 10_12.txt, 10_13.txt, 10_14.txt, 10_15.txt, 10_16.txt, 10_17.txt, 20_01.txt, 20_02.txt, 20_03.txt, 20_04.txt, 20_05.txt, 20_06.txt, 20_07.txt, 20_08.txt, 20_09.txt, 20_10.txt, 20_11.txt, 20_12.txt, 20_13.txt, 20_14.txt, 20_15.txt, 20_16.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 2 ms 2560 KB
00_example_02.txt AC 2 ms 2560 KB
10_01.txt AC 3 ms 2688 KB
10_02.txt AC 2 ms 2560 KB
10_03.txt AC 2 ms 2560 KB
10_04.txt AC 2 ms 2560 KB
10_05.txt AC 3 ms 2688 KB
10_06.txt AC 2 ms 2560 KB
10_07.txt AC 5 ms 2688 KB
10_08.txt AC 8 ms 2688 KB
10_09.txt AC 8 ms 2688 KB
10_10.txt AC 8 ms 2688 KB
10_11.txt AC 8 ms 2688 KB
10_12.txt AC 8 ms 2688 KB
10_13.txt AC 7 ms 2688 KB
10_14.txt AC 6 ms 2688 KB
10_15.txt AC 6 ms 2688 KB
10_16.txt AC 8 ms 2688 KB
10_17.txt AC 8 ms 2688 KB
20_01.txt AC 331 ms 8448 KB
20_02.txt AC 331 ms 8448 KB
20_03.txt AC 332 ms 8448 KB
20_04.txt AC 39 ms 3328 KB
20_05.txt AC 7 ms 2688 KB
20_06.txt AC 149 ms 4224 KB
20_07.txt AC 8 ms 2688 KB
20_08.txt AC 48 ms 3584 KB
20_09.txt AC 7 ms 2688 KB
20_10.txt AC 48 ms 3456 KB
20_11.txt AC 63 ms 3840 KB
20_12.txt AC 212 ms 7168 KB
20_13.txt AC 282 ms 8192 KB
20_14.txt AC 289 ms 8320 KB
20_15.txt AC 291 ms 8952 KB
20_16.txt AC 299 ms 9080 KB