# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422102 | Antekb | Toy Train (IOI17_train) | C++14 | 542 ms | 99484 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>
#define st first
#define nd second
#define pb(x) push_back(x)
using namespace std;
const int N=5005;
vector<int> E[N], rE[N];
int d[N];
int wsk=0;
int czy[N][N], dobre[N];
int vis[N];
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> uu, std::vector<int> vv) {
int n=a.size(), m=uu.size();
std::vector<int> res(n);
for(int i=0; i<m; i++){
//cout<<uu[i]<<" "<<vv[i]<<"\n";
E[uu[i]].pb(vv[i]);
rE[vv[i]].pb(uu[i]);
}
for(int i=0; i<n; i++){
if(r[i]){
for(int j=0; j<n; j++)d[j]=E[j].size(), vis[j]=0;
vector<int> V;
V.push_back(i);
for(int j=0; j<V.size(); j++){
//cout<<i<<" "<<V[j]<<"\n";
if(j)czy[V[j]][i]=1;
if(V[j]==i && j!=0)continue;
int v=V[j];
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... |