# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
364786 | leinad2 | Stations (IOI20_stations) | C++17 | 1101 ms | 1364 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 "stations.h"
#include<bits/stdc++.h>
using namespace std;
vector<int>adj[1010];
int in[1010], out[1010], cnt, vis[1010];
void dfs(int v)
{
in[v]=++cnt;
for(int i=0;i<adj[v].size();i++)
{
int p=adj[v][i];
if(!vis[p])
{
vis[p]=1;
dfs(p);
}
}
out[v]=cnt;
}
vector<int>label(int n, int k, vector<int>u, vector<int>v)
{
vis[0]=1;
for(int i=1;i<n;i++)vis[i]=0;
cnt=0;
for(int i=0;i<n;i++)in[i]=out[i]=0,adj[i].clear();
for(int i=0;i<u.size();i++)
{
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
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... |