Submission #1586799
Source Code Expand
#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
vector < vector < int > > graph;
int n, m, q, state[100050], color[100050], vis[100050];
int id = 1;
struct query
{
int v, d, c;
}A[100050];
void dfs(int node, int c, int dep)
{
if(!color[node])
color[node] = c;
vis[node] = id;
if(dep == 0) return;
for(int i = 0;i < graph[node].size();++i)
{
int to = graph[node][i];
if(vis[to] != id)
{
dfs(to, c, dep - 1);
}
}
}
int main()
{
scanf("%d%d", &n, &m);
graph.resize(n + 5);
for(int i = 0;i < m;++i)
{
int a, b;
scanf("%d%d", &a, &b);
--a;--b;
graph[a].push_back(b);
graph[b].push_back(a);
}
scanf("%d", &q);
for(int i = 0;i < q;++i)
{
scanf("%d%d%d", &A[i].v, &A[i].d, &A[i].c);
--A[i].v;
}
for(int i = q - 1;i > -1;--i)
{
if(state[A[i].v] >= A[i].d) continue;
state[A[i].v] = A[i].d;
dfs(A[i].v, A[i].c, A[i].d);
++id;
}
for(int i = 0;i < n;++i)
{
printf("%d\n", color[i]);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Splatter Painting |
User |
vjudge5 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1210 Byte |
Status |
WA |
Exec Time |
2104 ms |
Memory |
8440 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:39:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &m);
^
./Main.cpp:44:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &a, &b);
^
./Main.cpp:50:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &q);
^
./Main.cpp:53:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &A[i].v, &A[i].d, &A[i].c);
^
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
0 / 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 |
1 ms |
256 KB |
00_example_02.txt |
AC |
1 ms |
256 KB |
10_01.txt |
WA |
2 ms |
256 KB |
10_02.txt |
WA |
1 ms |
256 KB |
10_03.txt |
WA |
1 ms |
256 KB |
10_04.txt |
WA |
1 ms |
256 KB |
10_05.txt |
WA |
1 ms |
256 KB |
10_06.txt |
AC |
1 ms |
256 KB |
10_07.txt |
WA |
1 ms |
384 KB |
10_08.txt |
WA |
4 ms |
384 KB |
10_09.txt |
WA |
4 ms |
384 KB |
10_10.txt |
WA |
4 ms |
384 KB |
10_11.txt |
WA |
4 ms |
384 KB |
10_12.txt |
WA |
4 ms |
384 KB |
10_13.txt |
WA |
2 ms |
384 KB |
10_14.txt |
WA |
2 ms |
384 KB |
10_15.txt |
WA |
2 ms |
384 KB |
10_16.txt |
AC |
21 ms |
384 KB |
10_17.txt |
AC |
22 ms |
384 KB |
20_01.txt |
WA |
1197 ms |
8064 KB |
20_02.txt |
WA |
1010 ms |
8064 KB |
20_03.txt |
WA |
1237 ms |
8064 KB |
20_04.txt |
WA |
38 ms |
1152 KB |
20_05.txt |
WA |
4 ms |
384 KB |
20_06.txt |
WA |
11 ms |
3840 KB |
20_07.txt |
WA |
3 ms |
384 KB |
20_08.txt |
WA |
29 ms |
1152 KB |
20_09.txt |
WA |
3 ms |
384 KB |
20_10.txt |
WA |
18 ms |
1152 KB |
20_11.txt |
WA |
46 ms |
1536 KB |
20_12.txt |
WA |
48 ms |
6784 KB |
20_13.txt |
WA |
101 ms |
7808 KB |
20_14.txt |
WA |
115 ms |
7808 KB |
20_15.txt |
TLE |
2104 ms |
8440 KB |
20_16.txt |
TLE |
2104 ms |
8440 KB |