# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341711 | ogibogi2004 | Stations (IOI20_stations) | C++14 | 1174 ms | 1252 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 <vector>
#include<bits/stdc++.h>
using namespace std;
#define time afds
const int MAXN=1024;
vector<int>g[MAXN];
int depth[MAXN];
int in_time[MAXN],out_time[MAXN],time=-1;
void dfs(int u,int par)
{
in_time[u]=++time;
for(auto v:g[u])
{
if(v==par)continue;
depth[v]=depth[u]+1;
dfs(v,u);
}
out_time[u]=++time;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
time=-1;
memset(depth,-1,sizeof(depth));
for(int i=0;i<=n;i++)g[i].clear();
for(int i=0;i<u.size();i++)
{
g[u[i]].push_back(v[i]);
g[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... |