# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428678 | REALITYNB | Toy Train (IOI17_train) | C++14 | 1454 ms | 99524 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>
#include "train.h"
using namespace std;
const int N = 5001 ;
vector<int> adj[N] ;
void dfs(int i , vector<int>&vis){
vis[i]=1 ;
for(int x: adj[i]){
if(vis[x]==0) dfs(x,vis) ;
}
return ;
}
vector<int> who_wins(vector<int> a,vector<int> r,vector<int> u,vector<int>v){
int n = a.size() ;
for(int i=0;i<u.size();i++)adj[u[i]].push_back(v[i]) ;
vector<vector<int>> reachable(n) ;
for(int i=0;i<n;i++){
reachable[i].resize(n) ;
dfs(i,reachable[i]);
reachable[i][i]=0 ;
for(int x : adj[i]) if(x==i) reachable[i][i]=1;
}
vector<int> cycle(n) ;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(reachable[i][j]&&reachable[j][i]){
cycle[i]=1;
}
}
}
vector<int> ans(n) ;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(cycle[j]&&(reachable[i][j]||i==j)&&r[j]){
ans[i]=1 ;
break ;
}
}
}
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... |