# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287149 | peti1234 | Toy Train (IOI17_train) | C++17 | 436 ms | 1792 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int c=5002;
int n, m, v[c], db[c], si[c];
bool sol[c];
vector<int> sz[c], inv[c], ans;
queue<int> q;
vector<int> who_wins(vector<int> ki, vector<int> t, vector<int> x, vector<int> y) {
n=ki.size(), m=x.size();
for (int i=0; i<m; i++) {
int a=x[i], b=y[i];
sz[a].push_back(b), inv[b].push_back(a);
}
for (int i=0; i<n; i++) si[i]=sz[i].size();
for (int i=0; i<n; i++) {
if (t[i]) {
v[i]=-1;
q.push(i);
while(q.size()>0) {
int id=q.front();
q.pop();
if (v[id]!=1) {
v[id]++;
for (int i=0; i<inv[id].size(); i++) {
int x=inv[id][i];
db[x]++;
if (!v[x] && (db[x]==si[x] || (db[x]==1 && ki[x]))) q.push(x);
}
}
}
if (v[i]) for (int j=0; j<n; j++) sol[j]^=v[j];
for (int j=0; j<n; j++) v[j]=0, db[j]=0;
}
}
for (int i=0; i<n; i++) ans.push_back(sol[i]);
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |