# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1154911 | alexdd | Toy Train (IOI17_train) | C++20 | 888 ms | 1716 KiB |
#include "train.h"
#include<bits/stdc++.h>
using namespace std;
int n;
vector<int> rez;
vector<int> con[5005],con_rev[5005];
vector<int> a,r;
bool bun[5005];
bool visited[5005];
bool gasit;
int inc;
void dfs(int nod)
{
if(gasit)
return;
visited[nod]=1;
for(int adj:con[nod])
{
if(gasit)
return;
if(adj==inc)
{
gasit=1;
return;
}
if(!visited[adj])
dfs(adj);
}
}
bool find_cycle(int s)
# | 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... |