Submission #1836804
Source Code Expand
#include <iostream> #include <sstream> #include <iomanip> #include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <cstring> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <algorithm> #include <iterator> #include <bitset> #include <ctime> using namespace std; #define F(i, n) for(int i = 0; i < n; ++i) #define FOR(i,a,b) for (int i = (a); i < (b); i++) #define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--) #define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++) #define FILL(a,value) memset(a, value, sizeof(a)) #define SZ(a) (int)a.size() #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair typedef long long LL; typedef vector<int> VI; typedef pair<int, int> PII; const double PI = acos(-1.0); const int INF = 1000 * 1000 * 1000 + 7; const LL LINF = INF * (LL) INF; const int MAX = 200*1000+47; VI G[MAX]; int A[MAX]; bool DFS(int v) { FOR(i, 0, SZ(G[v])) { int to = G[v][i]; if (A[to] < A[v]) if (!DFS(to)) return 1; } return 0; } int main() { int n; scanf("%d", &n); FOR(i, 0, n)scanf("%d", A + i); FOR(i, 0, n-1) { int a, b; scanf("%d%d", &a, &b); --a, --b; G[a].PB(b); G[b].PB(a); } FOR(i, 0, n) if (DFS(i)) printf("%d ", i+1); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | vjudge5 |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1477 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 5120 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:60:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:61:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] FOR(i, 0, n)scanf("%d", A + i); ^ ./Main.cpp:66:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &a, &b); ^
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 | 5 ms | 4992 KB |
in10.txt | AC | 5 ms | 4992 KB |
in11.txt | AC | 5 ms | 4992 KB |
in12.txt | AC | 4 ms | 4992 KB |
in13.txt | AC | 4 ms | 4992 KB |
in14.txt | AC | 5 ms | 4992 KB |
in15.txt | AC | 5 ms | 4992 KB |
in16.txt | AC | 5 ms | 4992 KB |
in17.txt | AC | 5 ms | 4992 KB |
in18.txt | AC | 5 ms | 4992 KB |
in19.txt | AC | 5 ms | 4992 KB |
in2.txt | AC | 5 ms | 4992 KB |
in20.txt | AC | 5 ms | 4992 KB |
in21.txt | AC | 5 ms | 4992 KB |
in22.txt | AC | 5 ms | 4992 KB |
in23.txt | AC | 5 ms | 4992 KB |
in24.txt | AC | 5 ms | 4992 KB |
in25.txt | AC | 5 ms | 4992 KB |
in26.txt | AC | 5 ms | 4992 KB |
in27.txt | AC | 5 ms | 4992 KB |
in28.txt | AC | 5 ms | 4992 KB |
in29.txt | AC | 5 ms | 4992 KB |
in3.txt | AC | 5 ms | 4992 KB |
in30.txt | AC | 5 ms | 4992 KB |
in31.txt | AC | 5 ms | 4992 KB |
in32.txt | AC | 5 ms | 5120 KB |
in33.txt | AC | 5 ms | 5120 KB |
in34.txt | AC | 5 ms | 4992 KB |
in35.txt | AC | 5 ms | 5120 KB |
in36.txt | AC | 3 ms | 4992 KB |
in37.txt | AC | 3 ms | 4864 KB |
in38.txt | AC | 3 ms | 4864 KB |
in39.txt | AC | 3 ms | 4864 KB |
in4.txt | AC | 5 ms | 4992 KB |
in40.txt | AC | 5 ms | 4992 KB |
in41.txt | AC | 5 ms | 4992 KB |
in42.txt | AC | 5 ms | 4992 KB |
in43.txt | AC | 5 ms | 4992 KB |
in44.txt | AC | 5 ms | 4992 KB |
in45.txt | AC | 5 ms | 4992 KB |
in46.txt | AC | 5 ms | 4992 KB |
in47.txt | AC | 5 ms | 4992 KB |
in48.txt | AC | 5 ms | 4992 KB |
in49.txt | AC | 5 ms | 4992 KB |
in5.txt | AC | 4 ms | 4992 KB |
in50.txt | AC | 5 ms | 4992 KB |
in6.txt | AC | 5 ms | 4992 KB |
in7.txt | AC | 5 ms | 4992 KB |
in8.txt | AC | 5 ms | 4992 KB |
in9.txt | AC | 5 ms | 4992 KB |
sample1.txt | AC | 4 ms | 4992 KB |
sample2.txt | AC | 3 ms | 4992 KB |
sample3.txt | AC | 3 ms | 4992 KB |