Submission #1128787
Source Code Expand
#include <cstdio> #include <cstring> #include <algorithm> #include <queue> #include <iostream> #include <string> #include <cmath> #include <vector> #include <set> #include <map> #include <bitset> #include <stack> using namespace std; #define REP(i,n) for ( int i=1; i<=int(n); i++ ) #define MP make_pair #define PB push_back #define SZ(x) (int((x).size())) #define ALL(x) (x).begin(), (x).end() #define X first #define Y second template<typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; } template<typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; } typedef long long LL; typedef pair<LL, int> pii; typedef long double LD; const int INF = 0x3f3f3f3f; template <class T> inline bool RD(T &ret) { char c; int sgn; if (c = getchar(), c == EOF) return 0; while (c != '-' && (c<'0' || c>'9')) c = getchar(); sgn = (c == '-') ? -1 : 1 , ret = (c == '-') ? 0 : (c - '0'); while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0'); ret *= sgn; return 1; } template <class T> inline void PT(T x) { if (x < 0) putchar('-') ,x = -x; if (x > 9) PT(x / 10); putchar(x % 10 + '0'); } const int N = 3e3 + 100; set<int> from[N]; set<int> to[N]; int val[N]; queue<int> que; int deg[N], ans[N]; void updatewin(int u) { for(auto v : from[u]) { if(ans[v] != -1) continue; if(val[v] > val[u]) { deg[v] --; from[v].insert(u); if(deg[v] == 0) que.push(v); } } } void updatefail(int u) { for(auto v : from[u]) { if(ans[v] != -1) continue; if(val[v] > val[u]) { ans[v] = 1; updatewin(v); } } } int main() { memset(ans, -1, sizeof(ans)); int n; cin >> n; for(int i = 1; i <= n; i ++) scanf("%d", &val[i]); for(int i = 1; i < n; i ++) { int u, v; scanf("%d %d", &u, &v); if(val[u] <= val[v]) { from[u].insert(v); to[v].insert(u); } if(val[u] >= val[v]) { from[v].insert(u); to[u].insert(v); } } for(int u = 1; u <= n; u ++) { int sz = 0; for(auto v : to[u]) { if(from[u].count(v) == 0) deg[u] ++; } if(deg[u] == 0) que.push(u); } while(! que.empty() ) { int u = que.front(); que.pop(); ans[u] = 0; updatefail(u); } vector<int> res; for(int i = 1; i <= n; i ++) if(ans[i] == 1) res.push_back(i); for(int i = 0; i < SZ(res); i ++) printf("%d%c", res[i], i == SZ(res) - 1 ? '\n' : ' '); }
Submission Info
Submission Time | |
---|---|
Task | F - Tree Game |
User | Toosimple |
Language | C++14 (GCC 5.4.1) |
Score | 1600 |
Code Size | 2560 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 1152 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:80:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i = 1; i <= n; i ++) scanf("%d", &val[i]); ^ ./Main.cpp:83:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &u, &v); ^
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 | 896 KB |
in10.txt | AC | 3 ms | 896 KB |
in11.txt | AC | 3 ms | 896 KB |
in12.txt | AC | 2 ms | 640 KB |
in13.txt | AC | 2 ms | 640 KB |
in14.txt | AC | 3 ms | 896 KB |
in15.txt | AC | 3 ms | 896 KB |
in16.txt | AC | 3 ms | 896 KB |
in17.txt | AC | 3 ms | 896 KB |
in18.txt | AC | 4 ms | 896 KB |
in19.txt | AC | 3 ms | 896 KB |
in2.txt | AC | 3 ms | 896 KB |
in20.txt | AC | 3 ms | 896 KB |
in21.txt | AC | 3 ms | 896 KB |
in22.txt | AC | 3 ms | 896 KB |
in23.txt | AC | 3 ms | 896 KB |
in24.txt | AC | 3 ms | 896 KB |
in25.txt | AC | 3 ms | 896 KB |
in26.txt | AC | 3 ms | 896 KB |
in27.txt | AC | 3 ms | 896 KB |
in28.txt | AC | 3 ms | 896 KB |
in29.txt | AC | 3 ms | 896 KB |
in3.txt | AC | 3 ms | 896 KB |
in30.txt | AC | 3 ms | 896 KB |
in31.txt | AC | 4 ms | 1024 KB |
in32.txt | AC | 3 ms | 896 KB |
in33.txt | AC | 3 ms | 896 KB |
in34.txt | AC | 4 ms | 896 KB |
in35.txt | AC | 3 ms | 896 KB |
in36.txt | AC | 1 ms | 512 KB |
in37.txt | AC | 1 ms | 512 KB |
in38.txt | AC | 1 ms | 512 KB |
in39.txt | AC | 1 ms | 512 KB |
in4.txt | AC | 3 ms | 896 KB |
in40.txt | AC | 4 ms | 1024 KB |
in41.txt | AC | 4 ms | 1024 KB |
in42.txt | AC | 4 ms | 1024 KB |
in43.txt | AC | 4 ms | 1024 KB |
in44.txt | AC | 4 ms | 1024 KB |
in45.txt | AC | 4 ms | 1152 KB |
in46.txt | AC | 4 ms | 1152 KB |
in47.txt | AC | 3 ms | 896 KB |
in48.txt | AC | 3 ms | 896 KB |
in49.txt | AC | 3 ms | 896 KB |
in5.txt | AC | 3 ms | 768 KB |
in50.txt | AC | 3 ms | 896 KB |
in6.txt | AC | 3 ms | 896 KB |
in7.txt | AC | 3 ms | 896 KB |
in8.txt | AC | 3 ms | 896 KB |
in9.txt | AC | 3 ms | 896 KB |
sample1.txt | AC | 1 ms | 512 KB |
sample2.txt | AC | 1 ms | 512 KB |
sample3.txt | AC | 1 ms | 512 KB |