Submission #1195007
Source Code Expand
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
VI e[100000];
int ans[100000];
void dfs(int now, int past, int d, int c){
ans[now] = c;
if (d == 0) return;
REP(i,e[now].size()){
int next = e[now][i];
if (next == past) continue;
dfs(next, now, d-1, c);
}
}
int main() {
int n, m, q;
cin >> n >> m;
while (m--){
int a, b;
scanf("%d %d", &a, &b);
a--;
b--;
e[a].push_back(b);
e[b].push_back(a);
}
cin >> q;
VI v(q), d(q), c(q);
REP(i,q){
scanf("%d %d %d", &v[i], &d[i], &c[i]);
v[i]--;
}
REP(i,q){
dfs(v[i], -1, d[i], c[i]);
}
REP(i,n){
printf("%d\n", ans[i]);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Splatter Painting |
User |
TangentDay |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1310 Byte |
Status |
TLE |
Exec Time |
2104 ms |
Memory |
7672 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:45:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &a, &b);
^
./Main.cpp:54:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &v[i], &d[i], &c[i]);
^
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
0 / 500 |
Status |
|
|
|
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 |
61 ms |
2560 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 |
414 ms |
2560 KB |
10_06.txt |
AC |
3 ms |
2560 KB |
10_07.txt |
AC |
2 ms |
2560 KB |
10_08.txt |
AC |
7 ms |
2688 KB |
10_09.txt |
AC |
6 ms |
2688 KB |
10_10.txt |
AC |
6 ms |
2688 KB |
10_11.txt |
AC |
7 ms |
2688 KB |
10_12.txt |
AC |
6 ms |
2688 KB |
10_13.txt |
AC |
3 ms |
2688 KB |
10_14.txt |
AC |
3 ms |
2688 KB |
10_15.txt |
AC |
3 ms |
2688 KB |
10_16.txt |
AC |
24 ms |
2688 KB |
10_17.txt |
AC |
24 ms |
2688 KB |
20_01.txt |
AC |
1178 ms |
7296 KB |
20_02.txt |
AC |
1205 ms |
7296 KB |
20_03.txt |
AC |
1227 ms |
7296 KB |
20_04.txt |
TLE |
2103 ms |
3328 KB |
20_05.txt |
AC |
11 ms |
2688 KB |
20_06.txt |
AC |
11 ms |
3200 KB |
20_07.txt |
AC |
6 ms |
2688 KB |
20_08.txt |
TLE |
2103 ms |
3584 KB |
20_09.txt |
AC |
4 ms |
2688 KB |
20_10.txt |
AC |
221 ms |
3456 KB |
20_11.txt |
TLE |
2103 ms |
3840 KB |
20_12.txt |
AC |
46 ms |
6272 KB |
20_13.txt |
AC |
97 ms |
7168 KB |
20_14.txt |
AC |
112 ms |
7296 KB |
20_15.txt |
TLE |
2104 ms |
7672 KB |
20_16.txt |
TLE |
2104 ms |
7672 KB |