Submission #1111542
Source Code Expand
#include<iostream> #include<fstream> #include<sstream> #include<algorithm> #include<vector> #include<queue> #include<map> #include<set> #include<string> #include<cmath> #include<cstdio> #include<cassert> using namespace std; #define REP(i,m,n) for(int i=(m); i<(int)(n); i++) #define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--) #define rep(i,n) REP(i,0,n) #define rrep(i,n) RREP(i,0,n) #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() #define aut(r,v) __typeof(v) r = (v) #define each(it,o) for(aut(it,(o).begin()); it!=(o).end(); ++it) #define reach(it,o) for(aut(it,(o).rbegin()); it!=(o).rend(); ++it) #define fi first #define se second #define dump(x) cerr << " [L" << __LINE__ << "] " << #x << " = " << (x) << endl; template<typename T>string join(vector<T>&v, string del=", ") {stringstream s;rep(i,v.size())s<<del<<v[i];return s.str().substr(del.size());} template<typename T1, typename T2> ostream& operator<<(ostream& o, const pair<T1, T2>& p) {return o<<"("<<p.first<<", "<<p.second<<")";} template<typename T>ostream& operator<<(ostream& o, vector<T>&v) {if(v.size())o<<"["<<join(v)<<"]";return o;} template<typename T>ostream& operator<<(ostream& o, vector<vector<T> >&vv) {int l=vv.size();if(l){rep(i,l){o<<(i==0?"[ ":",\n ")<<vv[i]<<(i==l-1?" ]":"");}}return o;} template<typename T>ostream& operator<<(ostream& o, const set<T>& st) {vector<T> v(st.begin(),st.end());o<<"{ "<<join(v)<<" }";return o;} template<typename T1, typename T2>ostream& operator<<(ostream& o, const map<T1, T2>& m) {each(p,m){o<<(p==m.begin()?"{ ":",\n ")<<*p<<(p==--m.end()?" }":"");}return o;} using ll = long long; using pii = pair<int, int>; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; const double PI = (1*acos(0.0)); const double INF = 0x3f3f3f3f; const double INFL = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-9; const double mod = 1e9 + 7; inline void finput(string filename) { freopen(filename.c_str(), "r", stdin); } vvi g; vi a; int dfs(int v, int par){ each(u, g[v]){ if(*u != par) if(a[v] > a[*u] && !dfs(*u, v)) return 1; } return 0; } int main(){ ios_base::sync_with_stdio(0); // finput("./input"); int N; cin >> N; g = vvi(N); a = vi(N); rep(i, N) cin >> a[i]; rep(i, N-1){ int u, v; cin >> u >> v; u--; v--; g[u].push_back(v); g[v].push_back(u); } rep(i, N) if(dfs(i, -1)) cout << i+1 << " "; cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | furikus |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 2613 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 512 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 | 3 ms | 512 KB |
in10.txt | AC | 3 ms | 512 KB |
in11.txt | AC | 3 ms | 512 KB |
in12.txt | AC | 2 ms | 384 KB |
in13.txt | AC | 2 ms | 384 KB |
in14.txt | AC | 3 ms | 512 KB |
in15.txt | AC | 3 ms | 512 KB |
in16.txt | AC | 3 ms | 512 KB |
in17.txt | AC | 3 ms | 512 KB |
in18.txt | AC | 3 ms | 512 KB |
in19.txt | AC | 3 ms | 512 KB |
in2.txt | AC | 3 ms | 512 KB |
in20.txt | AC | 3 ms | 512 KB |
in21.txt | AC | 3 ms | 384 KB |
in22.txt | AC | 3 ms | 512 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 | 512 KB |
in27.txt | AC | 3 ms | 512 KB |
in28.txt | AC | 3 ms | 512 KB |
in29.txt | AC | 3 ms | 384 KB |
in3.txt | AC | 3 ms | 512 KB |
in30.txt | AC | 3 ms | 512 KB |
in31.txt | AC | 2 ms | 512 KB |
in32.txt | AC | 2 ms | 512 KB |
in33.txt | AC | 2 ms | 512 KB |
in34.txt | AC | 2 ms | 512 KB |
in35.txt | AC | 2 ms | 512 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 | 3 ms | 512 KB |
in40.txt | AC | 2 ms | 512 KB |
in41.txt | AC | 3 ms | 512 KB |
in42.txt | AC | 3 ms | 512 KB |
in43.txt | AC | 2 ms | 512 KB |
in44.txt | AC | 3 ms | 512 KB |
in45.txt | AC | 2 ms | 384 KB |
in46.txt | AC | 2 ms | 384 KB |
in47.txt | AC | 3 ms | 512 KB |
in48.txt | AC | 3 ms | 512 KB |
in49.txt | AC | 3 ms | 512 KB |
in5.txt | AC | 2 ms | 384 KB |
in50.txt | AC | 3 ms | 512 KB |
in6.txt | AC | 3 ms | 512 KB |
in7.txt | AC | 3 ms | 512 KB |
in8.txt | AC | 3 ms | 512 KB |
in9.txt | AC | 3 ms | 512 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |