Submission #1569733
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> P; typedef pair<int,P> P1; typedef pair<P,P> P2; #define pu push #define pb push_back #define mp make_pair #define eps 1e-7 #define INF 1000000000 #define mod 1000000007 #define fi first #define sc second #define rep(i,x) for(int i=0;i<x;i++) #define repn(i,x) for(int i=1;i<=x;i++) #define SORT(x) sort(x.begin(),x.end()) #define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end()) #define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) #define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) int n,ok; vector<int>edge[100005]; int d[100005],num; void dfs(int v,int u,int d){ num+=(d==0); rep(i,edge[v].size()){ if(edge[v][i]==u)continue; dfs(edge[v][i],v,1-d); } } int main(){ cin>>n; rep(i,n-1){ int a,b;cin>>a>>b;edge[a].pb(b);edge[b].pb(a); } dfs(1,-1,0); puts(num*2==n?"Second":"First"); }
Submission Info
Submission Time | |
---|---|
Task | D - Black and White Tree |
User | IH19980412 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 954 Byte |
Status | WA |
Exec Time | 96 ms |
Memory | 5888 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 900 | ||||||
Status |
|
|
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 | 90 ms | 5888 KB |
in10.txt | AC | 91 ms | 5888 KB |
in11.txt | AC | 93 ms | 5760 KB |
in12.txt | AC | 10 ms | 2944 KB |
in13.txt | AC | 96 ms | 5760 KB |
in14.txt | AC | 91 ms | 5760 KB |
in15.txt | AC | 91 ms | 5760 KB |
in16.txt | AC | 90 ms | 5760 KB |
in17.txt | AC | 90 ms | 5760 KB |
in18.txt | AC | 92 ms | 5760 KB |
in19.txt | AC | 91 ms | 5760 KB |
in2.txt | AC | 91 ms | 5888 KB |
in20.txt | AC | 91 ms | 5760 KB |
in21.txt | AC | 91 ms | 5888 KB |
in22.txt | AC | 90 ms | 5888 KB |
in23.txt | AC | 91 ms | 5760 KB |
in24.txt | AC | 90 ms | 5760 KB |
in25.txt | AC | 91 ms | 5760 KB |
in26.txt | WA | 91 ms | 5760 KB |
in27.txt | AC | 92 ms | 5760 KB |
in28.txt | AC | 2 ms | 2560 KB |
in29.txt | AC | 90 ms | 5760 KB |
in3.txt | AC | 91 ms | 5888 KB |
in30.txt | AC | 90 ms | 5760 KB |
in31.txt | WA | 92 ms | 5760 KB |
in32.txt | WA | 91 ms | 5760 KB |
in33.txt | AC | 91 ms | 5760 KB |
in4.txt | AC | 90 ms | 5888 KB |
in5.txt | AC | 91 ms | 5888 KB |
in6.txt | AC | 90 ms | 5888 KB |
in7.txt | AC | 91 ms | 5888 KB |
in8.txt | AC | 90 ms | 5888 KB |
in9.txt | AC | 92 ms | 5888 KB |
sample1.txt | AC | 2 ms | 2560 KB |
sample2.txt | AC | 2 ms | 2560 KB |
sample3.txt | AC | 2 ms | 2560 KB |