Submission #1554589
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int Nmax = 3005; int n, i, x, y, val[Nmax], dad[Nmax]; bool used[Nmax], down[Nmax], all[Nmax]; vector<int> v[Nmax]; void dfs(int node) { down[node] = 0; used[node] = 1; for(auto son : v[node]) if(!used[son]) { dad[son] = node; dfs(son); if(!down[son] && val[node] > val[son]) down[node] = 1; } } void dfs2(int node) { all[node] = down[node] || (val[node] > val[dad[node]] && !all[dad[node]]); for(auto son : v[node]) if(son != dad[node]) dfs2(son); } int main() { // freopen("input", "r", stdin); cin.sync_with_stdio(false); cin >> n; for(i=1; i<=n; ++i) cin >> val[i]; for(i=1; i<n; ++i) { cin >> x >> y; v[x].push_back(y); v[y].push_back(x); } dfs(1); val[0] = (1<<30); dfs2(1); for(i=1; i<=n; ++i) if(all[i]) cout << i << ' '; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | Alexa2001 |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1023 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 640 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 | 2 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 | 2 ms | 512 KB |
in16.txt | AC | 3 ms | 512 KB |
in17.txt | AC | 2 ms | 512 KB |
in18.txt | AC | 2 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 | 640 KB |
in22.txt | AC | 3 ms | 512 KB |
in23.txt | AC | 3 ms | 640 KB |
in24.txt | AC | 3 ms | 640 KB |
in25.txt | AC | 3 ms | 512 KB |
in26.txt | AC | 3 ms | 640 KB |
in27.txt | AC | 3 ms | 512 KB |
in28.txt | AC | 3 ms | 512 KB |
in29.txt | AC | 3 ms | 512 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 | 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 | 2 ms | 512 KB |
in40.txt | AC | 2 ms | 512 KB |
in41.txt | AC | 2 ms | 512 KB |
in42.txt | AC | 2 ms | 512 KB |
in43.txt | AC | 2 ms | 512 KB |
in44.txt | AC | 2 ms | 512 KB |
in45.txt | AC | 2 ms | 512 KB |
in46.txt | AC | 2 ms | 512 KB |
in47.txt | AC | 2 ms | 512 KB |
in48.txt | AC | 2 ms | 512 KB |
in49.txt | AC | 2 ms | 512 KB |
in5.txt | AC | 2 ms | 384 KB |
in50.txt | AC | 2 ms | 512 KB |
in6.txt | AC | 2 ms | 512 KB |
in7.txt | AC | 2 ms | 512 KB |
in8.txt | AC | 2 ms | 512 KB |
in9.txt | AC | 2 ms | 512 KB |
sample1.txt | AC | 1 ms | 384 KB |
sample2.txt | AC | 1 ms | 384 KB |
sample3.txt | AC | 1 ms | 384 KB |