Submission #1194996
Source Code Expand
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ThxDem=b;i<ThxDem;++i)
using namespace std;
typedef long long ll;
vector<int> g[100005];
int q0[100005],q1[100005],q2[100005];
int c[100005];
bool v[100005][16];
int n,m,q;
queue<pair<int,int> > qq;
void bfs(int x, int d, int t){
if(v[x][d])return;
v[x][d]=true;
qq.push(mp(x,d));
while(!qq.empty()){
x=qq.front().fst;d=qq.front().snd;qq.pop();
if(!c[x])c[x]=t;
if(!d)continue;
for(int y:g[x])if(!v[y][d-1]){
v[y][d-1]=true;qq.push(mp(y,d-1));
}
}
}
int main(){
scanf("%d%d",&n,&m);
fore(i,0,m){
int x,y;
scanf("%d%d",&x,&y);x--;y--;
g[x].pb(y);g[y].pb(x);
}
scanf("%d",&q);
fore(i,0,q)scanf("%d%d%d",q0+i,q1+i,q2+i),q0[i]--;
for(int i=q-1;i>=0;--i)bfs(q0[i],q1[i],q2[i]);
fore(i,0,n)printf("%d\n",c[i]);
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Splatter Painting |
User |
mjhun |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
929 Byte |
Status |
AC |
Exec Time |
111 ms |
Memory |
10624 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:32:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:35:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);x--;y--;
^
./Main.cpp:38:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&q);
^
./Main.cpp:39:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fore(i,0,q)scanf("%d%d%d",q0+i,q1+i,q2+i),q0[i]--;
^
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 |
3 ms |
3712 KB |
00_example_02.txt |
AC |
3 ms |
3712 KB |
10_01.txt |
AC |
3 ms |
3712 KB |
10_02.txt |
AC |
3 ms |
3712 KB |
10_03.txt |
AC |
3 ms |
3712 KB |
10_04.txt |
AC |
3 ms |
3712 KB |
10_05.txt |
AC |
3 ms |
3712 KB |
10_06.txt |
AC |
3 ms |
3712 KB |
10_07.txt |
AC |
3 ms |
3712 KB |
10_08.txt |
AC |
4 ms |
3840 KB |
10_09.txt |
AC |
4 ms |
3840 KB |
10_10.txt |
AC |
4 ms |
3840 KB |
10_11.txt |
AC |
4 ms |
3840 KB |
10_12.txt |
AC |
4 ms |
3840 KB |
10_13.txt |
AC |
4 ms |
3840 KB |
10_14.txt |
AC |
3 ms |
3840 KB |
10_15.txt |
AC |
4 ms |
3840 KB |
10_16.txt |
AC |
4 ms |
3840 KB |
10_17.txt |
AC |
4 ms |
3840 KB |
20_01.txt |
AC |
106 ms |
10624 KB |
20_02.txt |
AC |
110 ms |
8960 KB |
20_03.txt |
AC |
111 ms |
8960 KB |
20_04.txt |
AC |
16 ms |
4608 KB |
20_05.txt |
AC |
4 ms |
3712 KB |
20_06.txt |
AC |
12 ms |
5760 KB |
20_07.txt |
AC |
4 ms |
3712 KB |
20_08.txt |
AC |
18 ms |
3968 KB |
20_09.txt |
AC |
4 ms |
3712 KB |
20_10.txt |
AC |
18 ms |
3840 KB |
20_11.txt |
AC |
23 ms |
3968 KB |
20_12.txt |
AC |
50 ms |
8704 KB |
20_13.txt |
AC |
82 ms |
8960 KB |
20_14.txt |
AC |
88 ms |
8832 KB |
20_15.txt |
AC |
75 ms |
10104 KB |
20_16.txt |
AC |
78 ms |
10152 KB |