Submission #1094846
Source Code Expand
#include <set> #include <map> #include <queue> #include <ctime> #include <cmath> #include <cstdio> #include <vector> #include <string> #include <cctype> #include <bitset> #include <cstring> #include <cstdlib> #include <utility> #include <iostream> #include <algorithm> #define REP(i,a,b) for(int i=(a);i<=(b);i++) #define PER(i,a,b) for(int i=(a);i>=(b);i--) #define RVC(i,S) for(int i=0;i<(S).size();i++) #define RAL(i,u) for(int i=fr[u];i!=-1;i=e[i].next) using namespace std; typedef long long LL; typedef pair<int,int> pii; template<class T> inline void read(T& num) { bool start=false,neg=false; char c; num=0; while((c=getchar())!=EOF) { if(c=='-') start=neg=true; else if(c>='0' && c<='9') { start=true; num=num*10+c-'0'; } else if(start) break; } if(neg) num=-num; } /*============ Header Template ============*/ struct edge { int next,to; }; const int maxn=3005; int a[maxn]; int fr[maxn]; edge e[maxn<<1]; int tote=0; inline void addone(int u,int v) { ++tote; e[tote].next=fr[u];fr[u]=tote;e[tote].to=v; } inline void addedge(int u,int v) { addone(u,v);addone(v,u); } int dfs(int x,int f) { RAL(i,x) if(e[i].to!=f) { if(a[x]>a[e[i].to] && !dfs(e[i].to,x)) return 1; } return 0; } int main() { int n; read(n); REP(i,1,n) read(a[i]); memset(fr,-1,sizeof(fr)); REP(i,1,n-1) { int u,v; read(u);read(v); addedge(u,v); } REP(i,1,n) if(dfs(i,0)) printf("%d ",i);putchar('\n'); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | frank_c1 |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1644 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 3 ms | 256 KB |
in10.txt | AC | 3 ms | 256 KB |
in11.txt | AC | 3 ms | 256 KB |
in12.txt | AC | 3 ms | 256 KB |
in13.txt | AC | 3 ms | 256 KB |
in14.txt | AC | 3 ms | 256 KB |
in15.txt | AC | 3 ms | 256 KB |
in16.txt | AC | 3 ms | 256 KB |
in17.txt | AC | 3 ms | 256 KB |
in18.txt | AC | 3 ms | 256 KB |
in19.txt | AC | 3 ms | 256 KB |
in2.txt | AC | 3 ms | 256 KB |
in20.txt | AC | 3 ms | 256 KB |
in21.txt | AC | 3 ms | 256 KB |
in22.txt | AC | 3 ms | 256 KB |
in23.txt | AC | 3 ms | 256 KB |
in24.txt | AC | 3 ms | 256 KB |
in25.txt | AC | 3 ms | 256 KB |
in26.txt | AC | 3 ms | 256 KB |
in27.txt | AC | 3 ms | 256 KB |
in28.txt | AC | 3 ms | 256 KB |
in29.txt | AC | 3 ms | 256 KB |
in3.txt | AC | 3 ms | 256 KB |
in30.txt | AC | 3 ms | 256 KB |
in31.txt | AC | 3 ms | 256 KB |
in32.txt | AC | 3 ms | 256 KB |
in33.txt | AC | 3 ms | 256 KB |
in34.txt | AC | 3 ms | 256 KB |
in35.txt | AC | 3 ms | 256 KB |
in36.txt | AC | 3 ms | 256 KB |
in37.txt | AC | 2 ms | 256 KB |
in38.txt | AC | 2 ms | 256 KB |
in39.txt | AC | 3 ms | 256 KB |
in4.txt | AC | 3 ms | 256 KB |
in40.txt | AC | 3 ms | 256 KB |
in41.txt | AC | 3 ms | 256 KB |
in42.txt | AC | 3 ms | 256 KB |
in43.txt | AC | 3 ms | 256 KB |
in44.txt | AC | 3 ms | 256 KB |
in45.txt | AC | 3 ms | 256 KB |
in46.txt | AC | 3 ms | 256 KB |
in47.txt | AC | 3 ms | 256 KB |
in48.txt | AC | 3 ms | 256 KB |
in49.txt | AC | 3 ms | 256 KB |
in5.txt | AC | 3 ms | 256 KB |
in50.txt | AC | 3 ms | 256 KB |
in6.txt | AC | 3 ms | 256 KB |
in7.txt | AC | 3 ms | 256 KB |
in8.txt | AC | 3 ms | 256 KB |
in9.txt | AC | 3 ms | 256 KB |
sample1.txt | AC | 3 ms | 256 KB |
sample2.txt | AC | 3 ms | 256 KB |
sample3.txt | AC | 2 ms | 256 KB |