Submission #1054769

#TimeUsernameProblemLanguageResultExecution timeMemory
1054769WansurToy Train (IOI17_train)C++14
12 / 100
8 ms1756 KiB
#include <bits/stdc++.h> #include "train.h" #define ent '\n' #define f first #define s second //#define int long long using namespace std; typedef long long ll; const int maxn = 5e3 + 12; const int mod = 1e9 + 7; vector<int> g[maxn], rg[maxn]; int in[maxn], out[maxn]; bool won[maxn]; int n, m; vector<int> who_wins(vector<int> a, vector<int> r, vector<int> U, vector<int> V){ n = a.size(), m = U.size(); int v = -1; for(int i=0;i<n;i++){ if(r[i]){ v = i; } } won[v] = 1; for(int i=0;i<m;i++){ g[U[i]].push_back(V[i]); rg[V[i]].push_back(U[i]); out[U[i]]++, in[V[i]]++; } queue<int> q; q.push(v); while(q.size()){ int v = q.front(); q.pop(); for(int to:rg[v]){ if(a[to] == 1 && !won[to]){ won[to] = 1; q.push(to); } else if(a[to] == 0){ out[to]--; if(!out[to]){ won[to] = 1; q.push(to); } } } } bool ok = 0; for(int to:g[v]){ if(won[to]){ ok = 1; } } vector<int> ans(n); if(ok){ for(int i=0;i<n;i++){ ans[i] = won[i]; } } return ans; }
#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...