Submission #1728188
Source Code Expand
#include<iostream>
#include<fstream>
#include<sstream>
#include<algorithm>
#include<cstdio>
#include<cctype>
#include<cassert>
#include<cmath>
#include<ctime>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<iomanip>
#include<utility>
using namespace std;
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define rg register
#define il inline
#define lch(x) ((x)<<1)
#define rch(x) ((x)<<1^1)
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define rep0(i,n) for(register int i=0;i<(n);++i)
#define per0(i,n) for(register int i=(n)-1;i>=0;--i)
#define rep(i,st,ed) for(register int i=(st);i<=(ed);++i)
#define per(i,ed,st) for(register int i=(ed);i>=(st);--i)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef double dbl;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> il T qmin(const T &a,const T &b){return a<b?a:b;}
template<typename T> il T qmax(const T &a,const T &b){return a>b?a:b;}
template<typename T> il void getmin(T &a,const T &b){if(a>b) a=b;}
template<typename T> il void getmax(T &a,const T &b){if(a<b) a=b;}
il void fileio(string s){
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
const int inf=(int)1e9+7;
const ll linf=(ll)1e17+7;
const int N=3005,M=N<<1;
int v[M],nxt[M];
int head[N],a[N];
int n;
il void addedge(int p,int x,int y){
v[p]=y,nxt[p]=head[x],head[x]=p;
}
il bool dfs(int u,int p){
for(int e=head[u];e;e=nxt[e]){
if(v[e]==p) continue;
if(a[v[e]]>=a[u]) continue;
if(!dfs(v[e],u)) return true;
}
return false;
}
int main(){
// fileio("test");
scanf("%d",&n);
rep(i,1,n) scanf("%d",a+i);
rep(i,1,n-1){
int x,y;
scanf("%d%d",&x,&y);
addedge(lch(i),x,y);
addedge(rch(i),y,x);
}
rep(i,1,n) if(dfs(i,0)) printf("%d ",i);
puts("");
return 0;
}
Submission Info
Submission Time |
|
Task |
F - Tree Game |
User |
zyding |
Language |
C++14 (GCC 5.4.1) |
Score |
1600 |
Code Size |
2041 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
256 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:74:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:75:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i,1,n) scanf("%d",a+i);
^
./Main.cpp:78:22: 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 |
2 ms |
256 KB |
in10.txt |
AC |
2 ms |
256 KB |
in11.txt |
AC |
2 ms |
256 KB |
in12.txt |
AC |
2 ms |
256 KB |
in13.txt |
AC |
2 ms |
256 KB |
in14.txt |
AC |
2 ms |
256 KB |
in15.txt |
AC |
2 ms |
256 KB |
in16.txt |
AC |
2 ms |
256 KB |
in17.txt |
AC |
2 ms |
256 KB |
in18.txt |
AC |
2 ms |
256 KB |
in19.txt |
AC |
2 ms |
256 KB |
in2.txt |
AC |
2 ms |
256 KB |
in20.txt |
AC |
2 ms |
256 KB |
in21.txt |
AC |
2 ms |
256 KB |
in22.txt |
AC |
2 ms |
256 KB |
in23.txt |
AC |
2 ms |
256 KB |
in24.txt |
AC |
2 ms |
256 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 |
256 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 |
2 ms |
256 KB |
in46.txt |
AC |
2 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 |
256 KB |
in9.txt |
AC |
2 ms |
256 KB |
sample1.txt |
AC |
1 ms |
256 KB |
sample2.txt |
AC |
1 ms |
256 KB |
sample3.txt |
AC |
1 ms |
256 KB |