Submission #1054907

#TimeUsernameProblemLanguageResultExecution timeMemory
1054907WansurToy Train (IOI17_train)C++17
0 / 100
1362 ms1564 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]; bool won[maxn], del[maxn]; int out[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(); vector<int> ans(n); function<bool(int)> check = [&](int v){ for(int i=0;i<n;i++){ won[i] = out[i] = 0; g[i].clear(); rg[i].clear(); } for(int i=0;i<m;i++){ if(del[U[i]] || del[V[i]]){ continue; } out[U[i]]++; g[U[i]].push_back(V[i]); rg[V[i]].push_back(U[i]); } queue<int> q; won[v] = 1; while(q.size()){ int v = q.front(); q.pop(); for(int to:g[v]){ if(a[to] == 1 && !won[to]){ won[to] = 1; q.push(to); } if(a[to] == 0){ out[to]--; if(!out[to]){ won[to] = 1; q.push(to); } } } } bool ok = 0; for(int to:g[v]){ ok |= won[to]; } if(ok){ for(int i=0;i<n;i++){ if(won[i]){ ans[i] = 1; del[i] = 1; } } return 1; } return 0; }; while(1){ bool ok = 0; for(int i=0;i<n;i++){ if(a[i] == 1 && !del[i] && check(i)){ ok = 1; } } if(!ok) break; } return ans; }

Compilation message (stderr)

train.cpp: In lambda function:
train.cpp:24:29: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   24 |             won[i] = out[i] = 0;
      |                      ~~~~~~~^~~
#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...