Submission #1413734


Source Code Expand

#include <cstdio>
#include <algorithm>
#define maxn 100000+10
using namespace std;
int f[maxn],ans[maxn],n,m,Q,x,y,z,head[maxn],g;
struct xx
{
	int v,next;
}b[maxn<<1];

struct yy
{
	int x,d,col;
}a[maxn];

void add(int u,int v)
{
	b[++g]=(xx){v,head[u]};
	head[u]=g;
}

void dfs(int x,int d,int col)
{
	if (f[x]>=d) return ;
	f[x]=d;
	if (d<=0)return ;
	if (!ans[x])ans[x]=col;
	for (int i=head[x];i;i=b[i].next)
	{
		int v=b[i].v;
		dfs(v,d-1,col);
	}
}

int main()
{
	scanf("%d%d",&n,&m);
	for (int i=1;i<=m;++i)
	  scanf("%d%d",&x,&y),add(x,y),add(y,x);
	scanf("%d",&Q);
	for (int i=1;i<=Q;++i)
	  scanf("%d%d%d",&x,&y,&z),a[i]=(yy){x,y+1,z};
	for (int i=Q;i>=1;--i)
	  dfs(a[i].x,a[i].d,a[i].col);
	for (int i=1;i<=n;++i) printf("%d\n",ans[i]);
	return 0;
}

Submission Info

Submission Time
Task B - Splatter Painting
User vjudge1
Language C++14 (GCC 5.4.1)
Score 700
Code Size 762 Byte
Status AC
Exec Time 71 ms
Memory 4480 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:37: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:39:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d",&x,&y),add(x,y),add(y,x);
                                         ^
./Main.cpp:40:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&Q);
                ^
./Main.cpp:42:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d%d",&x,&y,&z),a[i]=(yy){x,y+1,z};
                                               ^

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 1 ms 128 KB
00_example_02.txt AC 1 ms 128 KB
10_01.txt AC 1 ms 128 KB
10_02.txt AC 1 ms 128 KB
10_03.txt AC 1 ms 128 KB
10_04.txt AC 1 ms 128 KB
10_05.txt AC 1 ms 128 KB
10_06.txt AC 1 ms 128 KB
10_07.txt AC 1 ms 256 KB
10_08.txt AC 2 ms 256 KB
10_09.txt AC 2 ms 256 KB
10_10.txt AC 2 ms 256 KB
10_11.txt AC 2 ms 256 KB
10_12.txt AC 2 ms 256 KB
10_13.txt AC 1 ms 256 KB
10_14.txt AC 1 ms 256 KB
10_15.txt AC 1 ms 256 KB
10_16.txt AC 1 ms 256 KB
10_17.txt AC 1 ms 256 KB
20_01.txt AC 71 ms 4480 KB
20_02.txt AC 71 ms 4480 KB
20_03.txt AC 71 ms 4480 KB
20_04.txt AC 16 ms 896 KB
20_05.txt AC 2 ms 256 KB
20_06.txt AC 9 ms 1536 KB
20_07.txt AC 2 ms 256 KB
20_08.txt AC 17 ms 1152 KB
20_09.txt AC 2 ms 256 KB
20_10.txt AC 16 ms 1024 KB
20_11.txt AC 22 ms 1408 KB
20_12.txt AC 31 ms 3072 KB
20_13.txt AC 53 ms 3968 KB
20_14.txt AC 57 ms 4096 KB
20_15.txt AC 50 ms 4224 KB
20_16.txt AC 51 ms 4480 KB