Submission #1094229
Source Code Expand
#include<stdio.h> #include<iostream> #include<vector> #include<algorithm> #include<string> #include<string.h> using namespace std; typedef long long LL; typedef vector<int> VI; #define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i) #define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i) #define eprintf(...) fprintf(stderr, __VA_ARGS__) template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; } template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; } template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) { for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); } putchar('\n'); } int N; int A[100111]; VI G[3111], ord; bool lose[3111]; bool dp[3111]; int par[3111]; int main() { scanf("%d", &N); REP (i, N) scanf("%d", A+i); REP (i, N-1) { int x, y; scanf("%d%d", &x, &y); x--; y--; G[x].push_back(y); G[y].push_back(x); } REP (i, N) { int m = A[G[i][0]]; EACH (e, G[i]) amin(m, A[*e]); if (m >= A[i]) { lose[i] = true; } } VI ans; REP (s, N) { ord.clear(); ord.push_back(s); par[s] = -1; REP (i_, N) { int v = ord[i_]; EACH (e, G[v]) if (*e != par[v]) { par[*e] = v; ord.push_back(*e); } } REP (i_, N) { int v = ord[N-1-i_]; if (lose[v]) dp[v] = false; else { dp[v] = false; EACH (e, G[v]) if (*e != par[v]) { if (A[v] > A[*e] && !dp[*e]) dp[v] = true; } } } if (dp[s]) ans.push_back(s+1); } rprintf("%d", ans.begin(), ans.end()); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | natsugiri |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 1693 Byte |
Status | AC |
Exec Time | 301 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:31:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:32:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] REP (i, N) scanf("%d", A+i); ^ ./Main.cpp:35:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &x, &y); ^
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 | 295 ms | 512 KB |
in10.txt | AC | 287 ms | 512 KB |
in11.txt | AC | 300 ms | 512 KB |
in12.txt | AC | 17 ms | 384 KB |
in13.txt | AC | 22 ms | 384 KB |
in14.txt | AC | 299 ms | 512 KB |
in15.txt | AC | 289 ms | 512 KB |
in16.txt | AC | 297 ms | 512 KB |
in17.txt | AC | 287 ms | 512 KB |
in18.txt | AC | 295 ms | 512 KB |
in19.txt | AC | 294 ms | 512 KB |
in2.txt | AC | 300 ms | 512 KB |
in20.txt | AC | 289 ms | 512 KB |
in21.txt | AC | 228 ms | 512 KB |
in22.txt | AC | 229 ms | 512 KB |
in23.txt | AC | 239 ms | 512 KB |
in24.txt | AC | 233 ms | 512 KB |
in25.txt | AC | 228 ms | 640 KB |
in26.txt | AC | 230 ms | 512 KB |
in27.txt | AC | 233 ms | 512 KB |
in28.txt | AC | 228 ms | 512 KB |
in29.txt | AC | 232 ms | 512 KB |
in3.txt | AC | 301 ms | 512 KB |
in30.txt | AC | 231 ms | 512 KB |
in31.txt | AC | 94 ms | 512 KB |
in32.txt | AC | 97 ms | 512 KB |
in33.txt | AC | 113 ms | 512 KB |
in34.txt | AC | 130 ms | 512 KB |
in35.txt | AC | 108 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 | 286 ms | 512 KB |
in40.txt | AC | 221 ms | 512 KB |
in41.txt | AC | 229 ms | 512 KB |
in42.txt | AC | 225 ms | 640 KB |
in43.txt | AC | 221 ms | 512 KB |
in44.txt | AC | 223 ms | 512 KB |
in45.txt | AC | 138 ms | 512 KB |
in46.txt | AC | 139 ms | 512 KB |
in47.txt | AC | 278 ms | 512 KB |
in48.txt | AC | 271 ms | 512 KB |
in49.txt | AC | 283 ms | 512 KB |
in5.txt | AC | 107 ms | 384 KB |
in50.txt | AC | 280 ms | 512 KB |
in6.txt | AC | 291 ms | 512 KB |
in7.txt | AC | 292 ms | 512 KB |
in8.txt | AC | 293 ms | 512 KB |
in9.txt | AC | 291 ms | 512 KB |
sample1.txt | AC | 3 ms | 384 KB |
sample2.txt | AC | 3 ms | 384 KB |
sample3.txt | AC | 3 ms | 384 KB |