# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321906 | tigicha | Stations (IOI20_stations) | C++17 | 1156 ms | 1292 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>
using namespace std;
int fix[1005], l;
vector<int>vec[1005], labels;
void dfs(int x, int y){
fix[x]=1;
if(y%2==0){
l++;
labels[x]=l;
}
for(int i=0; i<vec[x].size(); i++)
if(fix[vec[x][i]]!=1) dfs(vec[x][i], y+1);
if(y%2==1){
l++;
labels[x]=l;
}
}
std::vector<int> label(int n, int k, std::vector<int>u, std::vector<int>v){
labels.clear();
for(int i=0; i<n; i++)
labels.push_back(-1);
l=0;
for(int i=0; i<n; i++){
vec[i].clear();
fix[i]=0;
}
for(int i=0; i<u.size(); i++){
vec[u[i]].push_back(v[i]);
vec[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... |