Submission #1413859


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(); 
//		printf("%d %d\n",x,z);
		if(!f[x])f[x]=col;
		e[x]=max(e[x],z);
		if(z==0)continue;
		for(int i=h[x];i!=0;i=b[i].n){
			y=b[i].q;
			if(e[y]<z-1)Q.push((Dis){y,z-1});
		}
	}
}
int main(){
	memset(e,-1,sizeof(e));
	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--){
		if(e[a[i]]>=d[i])continue;
		col=c[i];
		Q.push((Dis){a[i],d[i]});
		Bfs();
	}
//	for(int i=1;i<=n;i++)printf("%d %d\n",i,e[i]);
	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 700
Code Size 997 Byte
Status AC
Exec Time 68 ms
Memory 5976 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:38: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:40: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:44:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&t);
                ^
./Main.cpp:45: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 200 / 200 500 / 500
Status
AC × 2
AC × 19
AC × 35
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 AC 2 ms 2304 KB
10_03.txt AC 2 ms 2304 KB
10_04.txt AC 2 ms 2304 KB
10_05.txt AC 2 ms 2304 KB
10_06.txt AC 2 ms 2304 KB
10_07.txt AC 2 ms 2304 KB
10_08.txt AC 3 ms 2304 KB
10_09.txt AC 3 ms 2304 KB
10_10.txt AC 3 ms 2304 KB
10_11.txt AC 3 ms 2304 KB
10_12.txt AC 3 ms 2304 KB
10_13.txt AC 2 ms 2304 KB
10_14.txt AC 2 ms 2304 KB
10_15.txt AC 2 ms 2304 KB
10_16.txt AC 3 ms 2432 KB
10_17.txt AC 3 ms 2432 KB
20_01.txt AC 68 ms 5504 KB
20_02.txt AC 68 ms 5504 KB
20_03.txt AC 68 ms 5376 KB
20_04.txt AC 36 ms 3712 KB
20_05.txt AC 3 ms 2304 KB
20_06.txt AC 10 ms 2560 KB
20_07.txt AC 3 ms 2304 KB
20_08.txt AC 23 ms 3072 KB
20_09.txt AC 3 ms 2304 KB
20_10.txt AC 17 ms 2816 KB
20_11.txt AC 23 ms 3200 KB
20_12.txt AC 31 ms 4736 KB
20_13.txt AC 54 ms 5248 KB
20_14.txt AC 57 ms 5376 KB
20_15.txt AC 54 ms 5888 KB
20_16.txt AC 55 ms 5976 KB