# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70051 | bnahmad15 | Toy Train (IOI17_train) | C++17 | 11 ms | 1184 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 "train.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 5001;
int n,is[N],vis[N],own[N];
vector <int> g[N],S;
int dfs(int u){
vis[u] = 1;
S.push_back(u);
int ret = 0;
if(own[u] == 0)
ret = 1;
for(int i = 0;i < g[u].size();i++){
int v = g[u][i];
if(vis[v] == 1){
bool flag = true;
for(int j = S.size()-1;j>=0;j--){
if(is[S[j]] == 1){
flag = false;
if(own[u] == 1)
return 1;
break;
}
if(S[j] == v)
break;
}
if(flag && own[u] == 0)
return 0;
continue;
}else{
if(own[u] == 1)
ret = max(ret,dfs(v));
else
ret = min(ret,dfs(v));
}
}
vis[u] = 0;
S.pop_back();
return ret;
}
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
std::vector<int> res;
n = a.size();
for(int i = 0;i<n;i++){
is[i] = 0;
}
for(int i = 0;i<u.size();i++){
g[u[i]].push_back(v[i]);
}
for(int i = 0;i<n;i++)
is[i] = r[i];
for(int i = 0;i<n;i++)
own[i] = a[i];
if(n <= 15){
int cnt = 0;
for(int i = 0;i<n;i++){
for(int j = 0;j<n;j++){
vis[j] = 0;
}
cnt++;
res.push_back(dfs(i));
}
assert(cnt == n);
}
return res;
}
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... |