Submission #1750850


Source Code Expand

#include<bits/stdc++.h>
#define N 200005
using namespace std;
int head[N],ver[N],nxt[N],tot;
void add(int a,int b)
{
	tot++;nxt[tot]=head[a];head[a]=tot;ver[tot]=b;return ;
}
int g[N];
bool flag,n;
void dfs(int x,int f)
{
	g[x]=0;
	for(int i=head[x];i;i=nxt[i])
	{
		if(ver[i]==f)continue;
		dfs(ver[i],x);
		if(!g[ver[i]])
		{
			if(!g[x])g[x]=1;
			else flag=1; 
		}
	}
}
int main()
{
	scanf("%d",&n);
	
		tot=0;
		int t1,t2;flag=0;
		for(int i=1;i<n;i++)
		{
			scanf("%d%d",&t1,&t2);
			add(t1,t2);add(t2,t1);
		}
		dfs(1,-1);
		for(int i=1;i<=n;i++)head[i]=0;
		if(flag||!g[1])puts("First");
		else puts("Second");
	
	return 0;	
} 

Submission Info

Submission Time
Task D - Black and White Tree
User SD_le
Language C++14 (GCC 5.4.1)
Score 0
Code Size 677 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:15: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘bool*’ [-Wformat=]
  scanf("%d",&n);
               ^
./Main.cpp:27:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:33:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d",&t1,&t2);
                         ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 2
WA × 1
AC × 26
WA × 13
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt AC 1 ms 256 KB
in10.txt AC 1 ms 256 KB
in11.txt WA 1 ms 256 KB
in12.txt WA 1 ms 256 KB
in13.txt WA 1 ms 256 KB
in14.txt WA 1 ms 256 KB
in15.txt WA 1 ms 256 KB
in16.txt WA 1 ms 256 KB
in17.txt WA 1 ms 256 KB
in18.txt WA 1 ms 256 KB
in19.txt WA 1 ms 256 KB
in2.txt AC 1 ms 256 KB
in20.txt WA 1 ms 256 KB
in21.txt AC 1 ms 256 KB
in22.txt AC 1 ms 256 KB
in23.txt AC 1 ms 256 KB
in24.txt AC 1 ms 256 KB
in25.txt AC 1 ms 256 KB
in26.txt AC 1 ms 256 KB
in27.txt AC 1 ms 256 KB
in28.txt WA 1 ms 256 KB
in29.txt AC 1 ms 256 KB
in3.txt AC 1 ms 256 KB
in30.txt AC 1 ms 256 KB
in31.txt AC 1 ms 256 KB
in32.txt AC 1 ms 256 KB
in33.txt AC 1 ms 256 KB
in4.txt AC 1 ms 256 KB
in5.txt AC 1 ms 256 KB
in6.txt AC 1 ms 256 KB
in7.txt AC 1 ms 256 KB
in8.txt AC 1 ms 256 KB
in9.txt AC 1 ms 256 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt WA 1 ms 256 KB