Submission #1124150
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int N = 3e3 + 5; int arr[N]; bool lose[N]; int n; vector < vector < int > > v(N); bool dfs(int node){ for(int to : v[node]){ if(arr[to] >= arr[node]) continue; if(!dfs(to)) return true; } return false; } int main(){ scanf("%d" , &n); for(int i = 1 ; i <= n ; i++){ scanf("%d" , &arr[i]); lose[i] = true; } for(int i = 0 ; i < n - 1 ; i++){ int x , y; scanf("%d %d" , &x , &y); v[x].emplace_back(y); v[y].emplace_back(x); } for(int i = 1 ; i <= n ; i++){ if(dfs(i)) printf("%d ", i); } puts(""); }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | sharath_gauss |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 607 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 384 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:16:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d" , &n); ^ ./Main.cpp:18:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d" , &arr[i]); ^ ./Main.cpp:23:27: 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, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 3 ms | 384 KB |
in10.txt | AC | 3 ms | 384 KB |
in11.txt | AC | 3 ms | 384 KB |
in12.txt | AC | 2 ms | 384 KB |
in13.txt | AC | 2 ms | 384 KB |
in14.txt | AC | 3 ms | 384 KB |
in15.txt | AC | 3 ms | 384 KB |
in16.txt | AC | 3 ms | 384 KB |
in17.txt | AC | 3 ms | 384 KB |
in18.txt | AC | 3 ms | 384 KB |
in19.txt | AC | 3 ms | 384 KB |
in2.txt | AC | 3 ms | 384 KB |
in20.txt | AC | 3 ms | 384 KB |
in21.txt | AC | 3 ms | 384 KB |
in22.txt | AC | 3 ms | 384 KB |
in23.txt | AC | 3 ms | 384 KB |
in24.txt | AC | 3 ms | 384 KB |
in25.txt | AC | 3 ms | 384 KB |
in26.txt | AC | 3 ms | 384 KB |
in27.txt | AC | 3 ms | 384 KB |
in28.txt | AC | 3 ms | 384 KB |
in29.txt | AC | 3 ms | 384 KB |
in3.txt | AC | 3 ms | 384 KB |
in30.txt | AC | 3 ms | 384 KB |
in31.txt | AC | 2 ms | 384 KB |
in32.txt | AC | 2 ms | 384 KB |
in33.txt | AC | 2 ms | 384 KB |
in34.txt | AC | 2 ms | 384 KB |
in35.txt | AC | 2 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 | AC | 3 ms | 384 KB |
in40.txt | AC | 2 ms | 384 KB |
in41.txt | AC | 2 ms | 384 KB |
in42.txt | AC | 2 ms | 384 KB |
in43.txt | AC | 2 ms | 384 KB |
in44.txt | AC | 2 ms | 384 KB |
in45.txt | AC | 2 ms | 384 KB |
in46.txt | AC | 2 ms | 384 KB |
in47.txt | AC | 2 ms | 384 KB |
in48.txt | AC | 2 ms | 384 KB |
in49.txt | AC | 2 ms | 384 KB |
in5.txt | AC | 2 ms | 384 KB |
in50.txt | AC | 2 ms | 384 KB |
in6.txt | AC | 3 ms | 384 KB |
in7.txt | AC | 3 ms | 384 KB |
in8.txt | AC | 3 ms | 384 KB |
in9.txt | AC | 3 ms | 384 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |