AtCoder Grand Contest 017

Submission #3449118

Source codeソースコード

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

struct Edge {
  int t,next;
  Edge() {}
  Edge(int a,int b):t(a),next(b) {}
};

Edge e[200005];
int head[100005];

int dfs(int x,int fa) {
  int s=0;
  for(int i=head[x];i;i=e[i].next)
    if (e[i].t!=fa) s^=dfs(e[i].t,x)+1;
  return s;
}

int main() {
  int n;
  scanf("%d",&n);
  for(int i=1;i<n;i++) {
  	int x,y;
  	scanf("%d%d",&x,&y);
  	e[2*i-1]=Edge(y,head[x]);
  	head[x]=2*i-1;
  	e[2*i]=Edge(x,head[y]);
  	head[y]=2*i;
  }
  puts((dfs(1,0))?"Alice":"Bob");
  return 0;
}

Submission

Task問題 D - Game on Tree
User nameユーザ名 mayaohua
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 1100
Source lengthソースコード長 598 Byte
File nameファイル名
Exec time実行時間 24 ms
Memory usageメモリ使用量 6784 KB

Compiler messageコンパイルメッセージ

./Main.cpp: In function ‘int main()’:
./Main.cpp:25:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:28:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^

Test case

Set

Set name Score得点 / Max score Cases
Sample - sample1.txt,sample2.txt,sample3.txt,sample4.txt
All 1100 / 1100 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
a1.txt AC 1 ms 128 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 21 ms 2176 KB
a14.txt AC 21 ms 2176 KB
a15.txt AC 17 ms 1792 KB
a16.txt AC 21 ms 2304 KB
a17.txt AC 21 ms 2304 KB
a18.txt AC 21 ms 2304 KB
a19.txt AC 21 ms 3200 KB
a2.txt AC 1 ms 256 KB
a20.txt AC 22 ms 3328 KB
a21.txt AC 18 ms 2688 KB
a22.txt AC 21 ms 2176 KB
a23.txt AC 21 ms 2176 KB
a24.txt AC 16 ms 1792 KB
a25.txt AC 21 ms 2304 KB
a26.txt AC 21 ms 2304 KB
a27.txt AC 21 ms 2304 KB
a28.txt AC 21 ms 3200 KB
a29.txt AC 22 ms 3328 KB
a3.txt AC 1 ms 256 KB
a30.txt AC 18 ms 2688 KB
a4.txt AC 2 ms 384 KB
a5.txt AC 2 ms 384 KB
a6.txt AC 2 ms 384 KB
a7.txt AC 2 ms 384 KB
a8.txt AC 2 ms 384 KB
a9.txt AC 2 ms 384 KB
b1.txt AC 24 ms 6784 KB
b2.txt AC 23 ms 4480 KB
b3.txt AC 24 ms 6784 KB
b4.txt AC 23 ms 4480 KB
b5.txt AC 23 ms 4480 KB
sample1.txt AC 1 ms 128 KB
sample2.txt AC 1 ms 128 KB
sample3.txt AC 1 ms 128 KB
sample4.txt AC 1 ms 128 KB