Submission #1409937


Source Code Expand

Copy
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<set>
#include<map>
#include<cstring>

#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)

using namespace std;

typedef long long LL;
typedef double db;

int get(){
	char ch;
	while(ch=getchar(),(ch<'0'||ch>'9')&&ch!='-');
	if (ch=='-'){
		int s=0;
		while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
		return -s;
	}
	int s=ch-'0';
	while(ch=getchar(),ch>='0'&&ch<='9')s=s*10+ch-'0';
	return s;
}

const int N = 200010;

struct edge{
	int x,nxt;
}e[N*2];
int h[N],tot;
int f[N];
int n;

void inse(int x,int y){
	e[++tot].x=y;
	e[tot].nxt=h[x];
	h[x]=tot;
}

bool vis[N];

void dfs(int x){
	f[x]=0;
	vis[x]=1;
	for(int p=h[x];p;p=e[p].nxt)
	if (!vis[e[p].x]){
		dfs(e[p].x);
		f[x]^=(f[e[p].x]+1);
	}
}

int main(){
	n=get();
	fo(i,1,n-1){
		int x=get(),y=get();
		inse(x,y);
		inse(y,x);
	}
	dfs(1);
	if (f[1])printf("Alice\n");
	else printf("Bob\n");
	return 0;
}

Submission Info

Submission Time
Task D - Game on Tree
User samjia2000
Language C++14 (GCC 5.4.1)
Score 1100
Code Size 1042 Byte
Status AC
Exec Time 18 ms
Memory 6528 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1100 / 1100
Status
AC × 4
AC × 43
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt, sample4.txt
All sample1.txt, sample2.txt, sample3.txt, sample4.txt, a1.txt, a10.txt, a11.txt, a12.txt, a13.txt, a14.txt, a15.txt, a16.txt, a17.txt, a18.txt, a19.txt, a2.txt, a20.txt, a21.txt, a22.txt, a23.txt, a24.txt, a25.txt, a26.txt, a27.txt, a28.txt, a29.txt, a3.txt, a30.txt, a4.txt, a5.txt, a6.txt, a7.txt, a8.txt, a9.txt, b1.txt, b2.txt, b3.txt, b4.txt, b5.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt
Case Name Status Exec Time Memory
a1.txt AC 1 ms 256 KB
a10.txt AC 2 ms 512 KB
a11.txt AC 2 ms 512 KB
a12.txt AC 2 ms 512 KB
a13.txt AC 15 ms 3456 KB
a14.txt AC 15 ms 3456 KB
a15.txt AC 12 ms 3328 KB
a16.txt AC 15 ms 3584 KB
a17.txt AC 15 ms 3584 KB
a18.txt AC 15 ms 3584 KB
a19.txt AC 16 ms 4224 KB
a2.txt AC 1 ms 256 KB
a20.txt AC 16 ms 4224 KB
a21.txt AC 13 ms 3968 KB
a22.txt AC 15 ms 3456 KB
a23.txt AC 16 ms 3456 KB
a24.txt AC 12 ms 3328 KB
a25.txt AC 15 ms 3584 KB
a26.txt AC 15 ms 3584 KB
a27.txt AC 15 ms 3584 KB
a28.txt AC 15 ms 4224 KB
a29.txt AC 17 ms 4224 KB
a3.txt AC 2 ms 384 KB
a30.txt AC 13 ms 3968 KB
a4.txt AC 2 ms 512 KB
a5.txt AC 2 ms 512 KB
a6.txt AC 2 ms 512 KB
a7.txt AC 2 ms 512 KB
a8.txt AC 2 ms 512 KB
a9.txt AC 2 ms 512 KB
b1.txt AC 18 ms 6528 KB
b2.txt AC 17 ms 4992 KB
b3.txt AC 18 ms 6528 KB
b4.txt AC 18 ms 4992 KB
b5.txt AC 17 ms 4992 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB
sample4.txt AC 1 ms 256 KB