# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321605 | keta_tsimakuridze | Stations (IOI20_stations) | C++14 | 960 ms | 1408 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 <cstdio>
#include "stations.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int fix[N],timer;
vector<int> V[N],labels;
void dfs(int u,int h){
fix[u]=1;
if(h%2==0) timer++,labels[u]=timer;
for(int i=0;i<V[u].size();i++){
if(!fix[V[u][i]]){
dfs(V[u][i],h+1);
}
}
if(h%2) timer++,labels[u]=timer;
}
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++)
V[i].clear(),fix[i]=0;
for (int i = 0; i < u.size(); i++) {
V[u[i]].push_back(v[i]);
V[v[i]].push_back(u[i]);
} timer=0;
for(int i=0;i<n;i++){
if(!fix[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... |