제출 #805967

#제출 시각아이디문제언어결과실행 시간메모리
805967fatemetmhr장난감 기차 (IOI17_train)C++17
23 / 100
98 ms1720 KiB
// ~ Be Name Khoda ~ // #include "train.h" #include <bits/stdc++.h> //#pragma GCC optimize ("O3") //#pragma GCC target("avx2") //#pragma GCC optimize("unroll-loops,Ofast") using namespace std; typedef long long ll; #define pb push_back #define mp make_pair #define all(x) x.begin(), x.end() #define fi first #define se second const int maxn = 1e6 + 10; const int maxn5 = 5e3 + 10; const int maxnt = 1.2e6 + 10; const int maxn3 = 1e3 + 10; const int mod = 1e9 + 7; const ll inf = 1e18; int cnt[maxn5], q[maxn5]; vector <int> adj[maxn5], jda[maxn5], ret; bool good[maxn5]; int n, m; std::vector<int> who_wins(std::vector<int> a, std::vector<int> ch, std::vector<int> u, std::vector<int> v) { n = a.size(); m = u.size(); for(int i = 0; i < m; i++){ adj[u[i]].pb(v[i]); jda[v[i]].pb(u[i]); } bool con = true; while(con){ con = false; memset(good, false, sizeof good); int l = 0, r = 0; for(int i = 0; i < n; i++){ cnt[i] = adj[i].size(); if(ch[i]) q[r++] = i; } while(l < r){ int v = q[l++]; for(auto u : jda[v]) if(!good[u]){ if(a[u] || cnt[u] == 1){ good[u] = true; q[r++] = u; } else cnt[u]--; } } for(int i = 0; i < n; i++) if(ch[i] && !good[i]){ ch[i] = false; con = true; } } for(int i = 0; i < n; i++) ret.pb(good[i]); return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...