Submission #1586596
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
const int N = 100001;
int n,m,q, maxi[N], ans[N];
vector <vector<int> > adjList(N);
void paint(int src, int dist, int clr) {
if(dist <= maxi[src])
return;
queue <pair<int,int> > q;
q.push(make_pair(src,dist));
while(!q.empty()) {
int node = q.front().first, currDist = q.front().second;
q.pop();
if(!ans[node])
ans[node] = clr;
currDist--;
if(currDist == -1)
continue;
for(int ch : adjList[node]) {
if(maxi[ch] < currDist) {
maxi[ch] = currDist;
q.push(make_pair(ch,currDist));
}
}
}
}
int main()
{
scanf("%d%d",&n,&m);
memset(maxi,-1,sizeof maxi);
for(int i = 0;i<m;i++) {
int x,y;
scanf("%d%d",&x,&y);
adjList[x].push_back(y);
adjList[y].push_back(x);
}
vector <pair<int,pair<int,int> > > queries;
scanf("%d",&m);
for(int i = 0;i<m;i++) {
int x,d,c;
scanf("%d%d%d",&x,&d,&c);
queries.push_back(make_pair(x,make_pair(d,c)));
}
for(int i = m-1;i>=0;i--)
paint(queries[i].first,queries[i].second.first,queries[i].second.second);
for(int i = 1;i<=n;i++)
printf("%d\n",ans[i]);
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Splatter Painting |
User |
vjudge5 |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1316 Byte |
Status |
AC |
Exec Time |
97 ms |
Memory |
9328 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:32:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:36:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^
./Main.cpp:41:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&m);
^
./Main.cpp:44:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&x,&d,&c);
^
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
500 / 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 |
2944 KB |
00_example_02.txt |
AC |
2 ms |
2944 KB |
10_01.txt |
AC |
3 ms |
3072 KB |
10_02.txt |
AC |
2 ms |
2944 KB |
10_03.txt |
AC |
3 ms |
2944 KB |
10_04.txt |
AC |
2 ms |
2944 KB |
10_05.txt |
AC |
3 ms |
3072 KB |
10_06.txt |
AC |
2 ms |
2944 KB |
10_07.txt |
AC |
3 ms |
2944 KB |
10_08.txt |
AC |
4 ms |
3072 KB |
10_09.txt |
AC |
4 ms |
3072 KB |
10_10.txt |
AC |
4 ms |
3072 KB |
10_11.txt |
AC |
4 ms |
3072 KB |
10_12.txt |
AC |
4 ms |
3072 KB |
10_13.txt |
AC |
3 ms |
3072 KB |
10_14.txt |
AC |
3 ms |
3072 KB |
10_15.txt |
AC |
3 ms |
3072 KB |
10_16.txt |
AC |
4 ms |
3072 KB |
10_17.txt |
AC |
4 ms |
3072 KB |
20_01.txt |
AC |
91 ms |
7796 KB |
20_02.txt |
AC |
97 ms |
7796 KB |
20_03.txt |
AC |
97 ms |
7796 KB |
20_04.txt |
AC |
14 ms |
3712 KB |
20_05.txt |
AC |
4 ms |
3200 KB |
20_06.txt |
AC |
12 ms |
3712 KB |
20_07.txt |
AC |
5 ms |
3200 KB |
20_08.txt |
AC |
20 ms |
4740 KB |
20_09.txt |
AC |
5 ms |
3200 KB |
20_10.txt |
AC |
23 ms |
4600 KB |
20_11.txt |
AC |
26 ms |
4740 KB |
20_12.txt |
AC |
47 ms |
6720 KB |
20_13.txt |
AC |
77 ms |
7672 KB |
20_14.txt |
AC |
81 ms |
7796 KB |
20_15.txt |
AC |
67 ms |
9072 KB |
20_16.txt |
AC |
69 ms |
9328 KB |