Submission #1502510
Source Code Expand
#include <cstdio> #include <functional> #include <vector> #define repeat(i, n) for (int i = 0; (i) < int(n); ++(i)) using namespace std; int main() { // input int n; scanf("%d", &n); vector<int> a(n); repeat (i, n) scanf("%d", &a[i]); vector<vector<int> > g(n); repeat (i, n - 1) { int x, y; scanf("%d%d", &x, &y); -- x; -- y; g[x].push_back(y); g[y].push_back(x); } // solve vector<int> memo(n, -1); function<bool (int)> go = [&](int i) { if (memo[i] != -1) return memo[i]; for (int j : g[i]) if (a[i] > a[j]) { if (not go(j)) { return memo[i] = true; } } return memo[i] = false; }; vector<int> result; repeat (i, n) if (a[i]) { if (go(i)) { result.push_back(i); } } // output repeat (i, result.size()) { printf("%d%c", result[i] + 1, i + 1 == result.size() ? '\n' : ' '); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | kimiyuki |
Language | C++14 (Clang 3.8.0) |
Score | 1600 |
Code Size | 1028 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 | 512 KB |
in22.txt | AC | 3 ms | 512 KB |
in23.txt | AC | 3 ms | 512 KB |
in24.txt | AC | 3 ms | 512 KB |
in25.txt | AC | 3 ms | 512 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 | 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 | 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 | 2 ms | 512 KB |
in43.txt | AC | 2 ms | 512 KB |
in44.txt | AC | 2 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 |