# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314127 | Jasiekstrz | Stations (IOI20_stations) | C++17 | 1184 ms | 1280 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<bits/stdc++.h>
#include "stations.h"
#define fi first
#define se second
using namespace std;
vector<int> e[1010];
vector<int> ans;
int dfs(int x,int p,int id,bool t)
{
if(!t)
ans[x]=id++;
for(auto v:e[x])
{
if(v!=p)
id=dfs(v,x,id,!t);
}
if(t)
ans[x]=id++;
return id;
}
vector<int> label(int n,int k,vector<int> u,vector<int> v)
{
ans=vector<int>(n);
for(int i=0;i<n;i++)
e[i].clear();
for(int i=0;i<n-1;i++)
{
e[u[i]].push_back(v[i]);
e[v[i]].push_back(u[i]);
}
# | 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... |