Submission #1358265
Source Code Expand
#include<bits/stdc++.h> #include<vector> #include<queue> #define N 3005 using namespace std; vector<int> G[N]; int n,a[N],sg[N],mex[N],d[N],dfn[N],m; void topsort() { int i,x; queue<int> Q; for(i=1;i<=n;i++) if(!d[i]) Q.push(i); while(!Q.empty()){ x=Q.front(),Q.pop(),dfn[++m]=x; for(i=0;i<G[x].size();i++) if(!(--d[G[x][i]])) Q.push(G[x][i]); } } int main() { int i,j,x,y; scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d",&a[i]); for(i=1;i<n;i++){ scanf("%d %d",&x,&y); if(a[x]>a[y]) G[x].push_back(y),d[y]++; if(a[y]>a[x]) G[y].push_back(x),d[x]++; } topsort(); for(i=n;i>=1;i--){ for(j=0;j<G[dfn[i]].size();j++) mex[sg[G[dfn[i]][j]]]=i; for(j=0;mex[j]==i;j++); sg[dfn[i]]=j; } for(i=1;i<=n;i++) if(sg[i]) printf("%d ",i); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | MemorySlices |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 826 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:23:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:25:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&a[i]); ^ ./Main.cpp:27:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&x,&y); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1600 / 1600 | ||||
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, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in5.txt, in50.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 3 ms | 384 KB |
in10.txt | AC | 3 ms | 384 KB |
in11.txt | AC | 3 ms | 384 KB |
in12.txt | AC | 2 ms | 384 KB |
in13.txt | AC | 2 ms | 384 KB |
in14.txt | AC | 3 ms | 384 KB |
in15.txt | AC | 3 ms | 384 KB |
in16.txt | AC | 3 ms | 384 KB |
in17.txt | AC | 3 ms | 384 KB |
in18.txt | AC | 3 ms | 384 KB |
in19.txt | AC | 3 ms | 384 KB |
in2.txt | AC | 3 ms | 384 KB |
in20.txt | AC | 3 ms | 384 KB |
in21.txt | AC | 3 ms | 384 KB |
in22.txt | AC | 3 ms | 384 KB |
in23.txt | AC | 3 ms | 384 KB |
in24.txt | AC | 3 ms | 384 KB |
in25.txt | AC | 3 ms | 384 KB |
in26.txt | AC | 3 ms | 384 KB |
in27.txt | AC | 3 ms | 384 KB |
in28.txt | AC | 3 ms | 384 KB |
in29.txt | AC | 3 ms | 384 KB |
in3.txt | AC | 3 ms | 384 KB |
in30.txt | AC | 3 ms | 384 KB |
in31.txt | AC | 2 ms | 512 KB |
in32.txt | AC | 2 ms | 384 KB |
in33.txt | AC | 2 ms | 384 KB |
in34.txt | AC | 2 ms | 384 KB |
in35.txt | AC | 2 ms | 384 KB |
in36.txt | AC | 1 ms | 384 KB |
in37.txt | AC | 1 ms | 384 KB |
in38.txt | AC | 1 ms | 384 KB |
in39.txt | AC | 1 ms | 384 KB |
in4.txt | AC | 3 ms | 384 KB |
in40.txt | AC | 2 ms | 384 KB |
in41.txt | AC | 2 ms | 384 KB |
in42.txt | AC | 2 ms | 384 KB |
in43.txt | AC | 2 ms | 384 KB |
in44.txt | AC | 2 ms | 384 KB |
in45.txt | AC | 2 ms | 384 KB |
in46.txt | AC | 2 ms | 384 KB |
in47.txt | AC | 2 ms | 384 KB |
in48.txt | AC | 2 ms | 384 KB |
in49.txt | AC | 2 ms | 384 KB |
in5.txt | AC | 2 ms | 384 KB |
in50.txt | AC | 2 ms | 384 KB |
in6.txt | AC | 3 ms | 384 KB |
in7.txt | AC | 3 ms | 384 KB |
in8.txt | AC | 3 ms | 384 KB |
in9.txt | AC | 3 ms | 384 KB |
sample1.txt | AC | 1 ms | 384 KB |
sample2.txt | AC | 1 ms | 384 KB |
sample3.txt | AC | 1 ms | 384 KB |