| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 674161 | Essa2006 | Stations (IOI20_stations) | C++14 | 709 ms | 512 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;
vector<int>Vis, new_, dt, ft;
vector<vector<int>>A;
int time_;
void dfs(int ind){
Vis[ind]=1, dt[ind]=time_++;
for(int i=0;i<A[ind].size();i++)
if(!Vis[A[ind][i]])
dfs(A[ind][i]);
ft[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;
dfs(0);
for(int i=0;i<n;i++){
new_[i]=dt[i]*2000+ft[i];
}
return new_;
}
int find_next_station(int s, int t, vector<int> c) {
int dt_t=t/2000, ft_t=t%2000;
for(int i=1;i<c.size();i++){
int dt_c=c[i]/2000, ft_c=c[i]%2000;
if(dt_t>=dt_c && ft_c>=ft_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... | ||||
