| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 675926 | Essa2006 | Stations (IOI20_stations) | C++14 | 831 ms | 672 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 all(a) a.begin(), a.end()
vector<int>Vis, new_, dt, ft;
vector<vector<int>>A;
bool even=1;
int time_;
void dfs(int ind){
Vis[ind]=1;
bool odd=!even;
if(!odd)
new_[ind]=time_++;
for(int i=0;i<A[ind].size();i++)
if(!Vis[A[ind][i]]){
even=odd;
dfs(A[ind][i]);
}
if(odd) new_[ind]=time_++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
Vis.clear(), A.clear(), new_.clear(), dt.clear(), ft.clear();
Vis.resize(n), A.resize(n), new_.resize(n), dt.resize(n), ft.resize(n);
time_=0;
for(int i=0;i<n-1;i++)
A[u[i]].push_back(v[i]), A[v[i]].push_back(u[i]);
dfs(0);
return new_;
}
int find_next_station(int s, int t, vector<int> c) {
if(c[0]>s){
if(t>s)
return c.front();
int ind=upper_bound(all(c), t)-c.begin();
ind--;
return c[ind];
}
else{
if(t<s) return c.back();
return *lower_bound(all(c), t);
}
}
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... | ||||
