# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321836 | lukameladze | Stations (IOI20_stations) | C++14 | 1063 ms | 15500 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;
long long lv[300005],tin,out[300005],in[300005],x[300005],tout;
std::vector <long long> v1[300005];
std::vector <int> labels;
vector < pair <long long, long long> >v2;
void dfs(int a, int p)
{
if (p!=-1)
lv[a]=lv[p]+1;
else lv[a]=1;
tin++;
in[a]=tin;
for (int i=0; i<v1[a].size(); i++)
{
if (p!=v1[a][i])
{
dfs(v1[a][i],a);
}
}
tin++;
out[a]=tin;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v)
{
labels.clear();
labels.resize(n);
for (int i=0; i<n; 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... |