# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415532 | Pro_ktmr | Stations (IOI20_stations) | C++17 | 1264 ms | 680 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;
#define pb push_back
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define repi(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#include "stations.h"
#include <vector>
void dfs(int v, int p, vector<int> e[], vector<int>& labels, int& c){
labels[v] = c;
for(auto i: e[v]){
if(i == p) continue;
c++;
dfs(i, v, e, labels, c);
c++;
}
if(c%2) labels[v] = c;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<int> e[1000];
rep(i, n-1){
e[u[i]].pb(v[i]);
e[v[i]].pb(u[i]);
}
vector<int> labels(n);
int c = 0;
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... |