# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
772452 | ono_de206 | Stations (IOI20_stations) | C++14 | 724 ms | 544 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<int> labels(n);
for (int i = 0; i < n; i++) {
labels[i] = i + 1;
}
for(int i = 0; i < n - 1; i++) {
assert((u[i] == i + 1 && v[i] == i / 2) || (u[i] == i / 2 && v[i] == i + 1));
}
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
auto check = [&](int mn, int mx) -> bool {
while(mx > mn) {
mx /= 2;
}
return mx == mn;
};
if(!check(s, t)) return c[0];
for(int i = 0; i < c.size(); i++) {
if(check(c[i], t)) return c[i];
}
return 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... |