Submission #1358057
Source Code Expand
#include<stdio.h> #include<iostream> #include<algorithm> #include<stdlib.h> #include<string.h> #include<queue> #define LL long long using namespace std; inline int read( ) { int sum=0;char c=getchar( );bool f=0; while(c<'0'||c>'9') {if(c=='-') f=1;c=getchar( );} while(c>='0'&&c<='9') {sum=sum*10+c-'0';c=getchar( );} if(f) return -sum; return sum; } const int N=3005; int n,a[N]; struct ex{int num,next;}map[N*2]; int head[N],len; inline void link(int x,int y) { if(a[x]==a[y]) return; if(a[x]<a[y]) swap(x,y); len++;map[len].num=y;map[len].next=head[x];head[x]=len; } bool vis[N];int sg[N],h[N],tim; inline void dfs(int k) { vis[k]=1;int i,x; for(i=head[k];i;i=map[i].next) if(!vis[x=map[i].num]) dfs(x); for(i=head[k],++tim;i;i=map[i].next) h[sg[map[i].num]]=tim; for(i=0;;i++) if(h[i]!=tim) {sg[k]=i;break;} } int main( ) { int i,x,y; n=read( ); for(i=1;i<=n;i++) a[i]=read( ); for(i=1;i<n;i++) x=read( ),y=read( ),link(x,y); for(i=1;i<=n;i++) if(!vis[i]) dfs(i); for(i=1;i<=n;i++) if(sg[i]) printf("%d ",i); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | qq872191552 |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1105 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 384 KB |
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 | 2 ms | 384 KB |
in10.txt | AC | 2 ms | 256 KB |
in11.txt | AC | 2 ms | 256 KB |
in12.txt | AC | 1 ms | 256 KB |
in13.txt | AC | 1 ms | 256 KB |
in14.txt | AC | 2 ms | 256 KB |
in15.txt | AC | 2 ms | 256 KB |
in16.txt | AC | 2 ms | 384 KB |
in17.txt | AC | 2 ms | 384 KB |
in18.txt | AC | 2 ms | 256 KB |
in19.txt | AC | 2 ms | 256 KB |
in2.txt | AC | 2 ms | 384 KB |
in20.txt | AC | 2 ms | 256 KB |
in21.txt | AC | 2 ms | 384 KB |
in22.txt | AC | 2 ms | 384 KB |
in23.txt | AC | 2 ms | 384 KB |
in24.txt | AC | 2 ms | 384 KB |
in25.txt | AC | 2 ms | 256 KB |
in26.txt | AC | 2 ms | 256 KB |
in27.txt | AC | 2 ms | 256 KB |
in28.txt | AC | 2 ms | 256 KB |
in29.txt | AC | 2 ms | 256 KB |
in3.txt | AC | 2 ms | 256 KB |
in30.txt | AC | 2 ms | 384 KB |
in31.txt | AC | 2 ms | 256 KB |
in32.txt | AC | 2 ms | 256 KB |
in33.txt | AC | 2 ms | 256 KB |
in34.txt | AC | 2 ms | 256 KB |
in35.txt | AC | 2 ms | 256 KB |
in36.txt | AC | 1 ms | 256 KB |
in37.txt | AC | 1 ms | 256 KB |
in38.txt | AC | 1 ms | 256 KB |
in39.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 2 ms | 256 KB |
in40.txt | AC | 2 ms | 256 KB |
in41.txt | AC | 2 ms | 256 KB |
in42.txt | AC | 2 ms | 256 KB |
in43.txt | AC | 2 ms | 256 KB |
in44.txt | AC | 2 ms | 256 KB |
in45.txt | AC | 1 ms | 256 KB |
in46.txt | AC | 1 ms | 256 KB |
in47.txt | AC | 2 ms | 256 KB |
in48.txt | AC | 2 ms | 256 KB |
in49.txt | AC | 2 ms | 256 KB |
in5.txt | AC | 2 ms | 256 KB |
in50.txt | AC | 2 ms | 256 KB |
in6.txt | AC | 2 ms | 256 KB |
in7.txt | AC | 2 ms | 256 KB |
in8.txt | AC | 2 ms | 384 KB |
in9.txt | AC | 2 ms | 384 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |