Submission #1502194
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define OUT(x) cerr << #x << " = " << x << endl; #define all(x) x.begin(), x.end() #define mp make_pair #define pii pair<int, int> #define piii pair<int, pair<int, int>> vector<int> a; vector<int> g[3030]; vector<bool> ans; static const int INF = 0x3f3f3f3f; void dfs(int i, int v, int prev, bool first) { int mina = INF; int minu = -1; for (int u : g[v]) if (u != prev) { if (mina > a[u]) { minu = u; mina = a[u]; } } if (mina < a[v]) dfs(i, minu, v, !first); else ans[i] = first; } int main() { int n; cin >> n; a.resize(n); for (int i = 0; i < n; i ++) { cin >> a[i]; } for (int i = 0; i < n - 1; i ++) { int a, b; cin >> a >> b; a --, b --; g[a].push_back(b); g[b].push_back(a); } ans.resize(n); for (int i = 0; i < n; i ++) { dfs(i, i, -1, 0); } for (int i = 0; i < n; i ++) { if (ans[i]) cout << i + 1 << ' '; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | KokiYmgch |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1309 Byte |
Status | WA |
Exec Time | 13 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 5 ms | 384 KB |
in10.txt | WA | 5 ms | 384 KB |
in11.txt | WA | 5 ms | 384 KB |
in12.txt | WA | 2 ms | 384 KB |
in13.txt | WA | 2 ms | 384 KB |
in14.txt | WA | 5 ms | 384 KB |
in15.txt | WA | 5 ms | 384 KB |
in16.txt | WA | 5 ms | 384 KB |
in17.txt | WA | 5 ms | 384 KB |
in18.txt | WA | 5 ms | 384 KB |
in19.txt | WA | 5 ms | 384 KB |
in2.txt | WA | 5 ms | 384 KB |
in20.txt | WA | 5 ms | 384 KB |
in21.txt | WA | 5 ms | 384 KB |
in22.txt | WA | 5 ms | 384 KB |
in23.txt | WA | 5 ms | 384 KB |
in24.txt | WA | 5 ms | 384 KB |
in25.txt | WA | 5 ms | 384 KB |
in26.txt | WA | 5 ms | 384 KB |
in27.txt | WA | 5 ms | 384 KB |
in28.txt | WA | 5 ms | 384 KB |
in29.txt | WA | 5 ms | 384 KB |
in3.txt | WA | 5 ms | 384 KB |
in30.txt | WA | 5 ms | 384 KB |
in31.txt | AC | 13 ms | 384 KB |
in32.txt | AC | 7 ms | 384 KB |
in33.txt | AC | 8 ms | 384 KB |
in34.txt | AC | 9 ms | 384 KB |
in35.txt | AC | 8 ms | 384 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 | WA | 5 ms | 384 KB |
in40.txt | AC | 4 ms | 384 KB |
in41.txt | AC | 4 ms | 384 KB |
in42.txt | AC | 4 ms | 384 KB |
in43.txt | AC | 4 ms | 384 KB |
in44.txt | AC | 4 ms | 384 KB |
in45.txt | AC | 4 ms | 384 KB |
in46.txt | AC | 4 ms | 384 KB |
in47.txt | WA | 4 ms | 384 KB |
in48.txt | WA | 4 ms | 384 KB |
in49.txt | WA | 4 ms | 384 KB |
in5.txt | WA | 4 ms | 384 KB |
in50.txt | WA | 4 ms | 384 KB |
in6.txt | WA | 5 ms | 384 KB |
in7.txt | WA | 5 ms | 384 KB |
in8.txt | WA | 5 ms | 384 KB |
in9.txt | WA | 5 ms | 384 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |