Submission #1413787


Source Code Expand

#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
#define N 100010
using namespace std;
struct Dis{
	int x,z;
};
queue<Dis>Q;
int a[N],c[N],d[N],e[N],f[N],num,h[N],n,m,p,q,t,col;
bool bo[N];
struct Edge{
	int p,q,n;
}b[N*2];
void ljb(int p,int q){
	b[++num].n=h[p];
	h[p]=num;
	b[num].p=p;
	b[num].q=q;
}
void Bfs(){
	int x,y,z;
	while(!Q.empty()){
		x=Q.front().x; z=Q.front().z; Q.pop(); 
		if(!f[x])f[x]=col;
		if(z<=e[x]||z==0)continue;
		e[x]=z;
		for(int i=h[x];i!=0;i=b[i].n){
			y=b[i].q;
			if(!bo[y]){
				Q.push((Dis){y,z-1});
				bo[y]=1;
			}
		}
	}
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		scanf("%d%d",&p,&q);
		ljb(p,q);
		ljb(q,p);
	}
	scanf("%d",&t);
	for(int i=1;i<=t;i++)scanf("%d%d%d",&a[i],&d[i],&c[i]);
	for(int i=t;i>=1;i--){
		memset(bo,0,sizeof(bo));
		if(e[a[i]]>=d[i])continue;
		col=c[i];
		Q.push((Dis){a[i],d[i]});
		bo[a[i]]=1;
		Bfs();
	}
	for(int i=1;i<=n;i++)printf("%d\n",f[i]);
}

Submission Info

Submission Time
Task B - Splatter Painting
User vjudge1
Language C++14 (GCC 5.4.1)
Score 0
Code Size 957 Byte
Status WA
Exec Time 376 ms
Memory 5932 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:39: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:41:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&p,&q);
                      ^
./Main.cpp:45:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&t);
                ^
./Main.cpp:46:56: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=t;i++)scanf("%d%d%d",&a[i],&d[i],&c[i]);
                                                        ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 200 0 / 500
Status
AC × 2
AC × 7
WA × 12
AC × 11
WA × 24
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 2304 KB
00_example_02.txt AC 2 ms 2304 KB
10_01.txt AC 2 ms 2304 KB
10_02.txt WA 2 ms 2304 KB
10_03.txt WA 2 ms 2304 KB
10_04.txt WA 2 ms 2304 KB
10_05.txt AC 2 ms 2304 KB
10_06.txt AC 2 ms 2304 KB
10_07.txt WA 2 ms 2304 KB
10_08.txt WA 9 ms 2304 KB
10_09.txt WA 9 ms 2304 KB
10_10.txt WA 9 ms 2304 KB
10_11.txt WA 9 ms 2304 KB
10_12.txt WA 9 ms 2304 KB
10_13.txt WA 3 ms 2304 KB
10_14.txt WA 2 ms 2304 KB
10_15.txt WA 2 ms 2304 KB
10_16.txt AC 9 ms 2432 KB
10_17.txt AC 9 ms 2432 KB
20_01.txt WA 375 ms 5504 KB
20_02.txt WA 372 ms 5504 KB
20_03.txt WA 376 ms 5376 KB
20_04.txt WA 16 ms 3328 KB
20_05.txt WA 20 ms 2304 KB
20_06.txt WA 25 ms 2560 KB
20_07.txt WA 24 ms 2304 KB
20_08.txt AC 233 ms 2944 KB
20_09.txt WA 20 ms 2304 KB
20_10.txt WA 257 ms 2816 KB
20_11.txt AC 315 ms 3072 KB
20_12.txt WA 62 ms 4736 KB
20_13.txt WA 282 ms 5248 KB
20_14.txt WA 347 ms 5376 KB
20_15.txt AC 357 ms 5888 KB
20_16.txt AC 358 ms 5932 KB