| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 432811 | A_D | Stations (IOI20_stations) | C++14 | 993 ms | 616 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;
vector<int> ret;
vector<vector<int>> g;
int timer;
void dfs(int u,int p)
{
ret[u]=timer++;
for(auto x:g[u]){
if(x==p)continue;
dfs(x,u);
}
}
vector<int> label(int n, int k,vector<int> u,vector<int> v){
timer=0;
g.clear();
ret.clear();
g.resize(n);
ret.resize(n);
for(int i=0;i<u.size();i++){
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
for(int i=0;i<n;i++){
if(g[i].size()==1){
dfs(i,i);
break;
}
}
return ret;
}
int find_next_station(int s, int t,vector<int> c){
int mx=0,mn=1e9;
for(auto x:c){
mn=min(mn,x);
mx=max(mx,x);
}
if(s<t)return mx;
else return mn;
}
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... | ||||
