# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
772505 | ono_de206 | Stations (IOI20_stations) | C++14 | 3 ms | 592 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 in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
// #define int long long
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<vector<int>> g(n);
for(int i = 0; i < n; i++) {
g[u[i]].pb(v[i]);
g[v[i]].pb(u[i]);
}
vector<int> in(n), out(n);
int t = 0;
auto dfs = [&](auto &self, int to, int fr) -> void {
in[to] = t++;
for(int x : g[to]) {
if(x == fr) continue;
self(self, x, to);
}
out[to] = t - 1;
};
vector<int> ret;
for(int i = 0; i < n; i++) {
ret.pb(in[i] * 1000 + out[i]);
}
return ret;
}
int find_next_station(int s, int t, vector<int> c) {
auto isPar = [&](int x, int y) -> bool {
return (x / 1000 <= y / 1000 && x % 1000 >= y % 1000);
};
int par = -1;
for(int i = 0; i < c.size(); i++) {
if(isPar(c[i], s)) par = i;
}
for(int i = 0; i < c.size(); i++) {
if(i == par) continue;
if(isPar(c[i], t)) return c[i];
}
return c[par];
}
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... |