# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
367304 | PurpleCrayon | Stations (IOI20_stations) | C++17 | 1148 ms | 1368 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;
#define sz(v) int(v.size())
int tt;
vector<int> ans;
vector<vector<int>> adj;
void dfs(int c=0, int p=-1, bool b=0){
if (!b) ans[c] = tt++;
for (auto nxt : adj[c]) if (nxt != p) dfs(nxt, c, b^1);
if (b) ans[c] = tt++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
ans.assign(n, -1), adj.assign(n, vector<int>()), tt=0;
for (int i = 0; i < n-1; i++)
adj[u[i]].push_back(v[i]), adj[v[i]].push_back(u[i]);
dfs();
return ans;
}
int find_next_station(int s, int t, vector<int> c) {
if (s == 0){ //ans for the root
for (auto nxt : c) if (nxt >= t) return nxt;
assert(false);
}
bool b=s>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... |