Submission #1092484
Source Code Expand
#include <iostream> #include <stdio.h> #include <vector> #include <algorithm> #include <set> #include <map> #include <cmath> #include <string> #include <cstring> #include <ctime> #include <cassert> #include <queue> #include <stack> #include <bitset> #define y1 y11 #define fs first #define sc second #define mp make_pair #define pb push_back #define mt make_tuple #define NAME "" using namespace std; typedef long long ll; typedef long double ld; const ld PI = acos(-1.0); const int MAXN = 4001; vector <int> e[MAXN]; int a[MAXN]; bool dfs(int v) { for (int i = 0; i < e[v].size(); i++) { int u = e[v][i]; if ((a[u] < a[v]) && (!dfs(u))) return true; } return false; } int main() { //freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i < n; i++) { int v1, v2; cin >> v1 >> v2; e[v1].push_back(v2); e[v2].push_back(v1); } for (int i = 1; i <= n; i++) { if (dfs(i)) cout << i << " "; } cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | cospleermusora |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1112 Byte |
Status | AC |
Exec Time | 10 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 6 ms | 512 KB |
in10.txt | AC | 6 ms | 512 KB |
in11.txt | AC | 6 ms | 512 KB |
in12.txt | AC | 4 ms | 384 KB |
in13.txt | AC | 4 ms | 384 KB |
in14.txt | AC | 6 ms | 512 KB |
in15.txt | AC | 6 ms | 512 KB |
in16.txt | AC | 6 ms | 512 KB |
in17.txt | AC | 6 ms | 512 KB |
in18.txt | AC | 6 ms | 512 KB |
in19.txt | AC | 6 ms | 384 KB |
in2.txt | AC | 6 ms | 512 KB |
in20.txt | AC | 6 ms | 384 KB |
in21.txt | AC | 6 ms | 384 KB |
in22.txt | AC | 6 ms | 512 KB |
in23.txt | AC | 6 ms | 384 KB |
in24.txt | AC | 6 ms | 384 KB |
in25.txt | AC | 6 ms | 512 KB |
in26.txt | AC | 6 ms | 512 KB |
in27.txt | AC | 6 ms | 384 KB |
in28.txt | AC | 6 ms | 384 KB |
in29.txt | AC | 6 ms | 384 KB |
in3.txt | AC | 6 ms | 384 KB |
in30.txt | AC | 6 ms | 384 KB |
in31.txt | AC | 6 ms | 512 KB |
in32.txt | AC | 6 ms | 512 KB |
in33.txt | AC | 6 ms | 640 KB |
in34.txt | AC | 6 ms | 512 KB |
in35.txt | AC | 6 ms | 512 KB |
in36.txt | AC | 3 ms | 384 KB |
in37.txt | AC | 3 ms | 384 KB |
in38.txt | AC | 3 ms | 384 KB |
in39.txt | AC | 3 ms | 384 KB |
in4.txt | AC | 10 ms | 512 KB |
in40.txt | AC | 6 ms | 512 KB |
in41.txt | AC | 6 ms | 512 KB |
in42.txt | AC | 6 ms | 512 KB |
in43.txt | AC | 6 ms | 512 KB |
in44.txt | AC | 6 ms | 512 KB |
in45.txt | AC | 5 ms | 384 KB |
in46.txt | AC | 5 ms | 512 KB |
in47.txt | AC | 6 ms | 512 KB |
in48.txt | AC | 6 ms | 512 KB |
in49.txt | AC | 6 ms | 384 KB |
in5.txt | AC | 5 ms | 384 KB |
in50.txt | AC | 6 ms | 512 KB |
in6.txt | AC | 7 ms | 512 KB |
in7.txt | AC | 6 ms | 512 KB |
in8.txt | AC | 6 ms | 512 KB |
in9.txt | AC | 6 ms | 512 KB |
sample1.txt | AC | 3 ms | 384 KB |
sample2.txt | AC | 3 ms | 384 KB |
sample3.txt | AC | 3 ms | 384 KB |