# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308349 | chubyxdxd | 기지국 (IOI20_stations) | C++17 | 862 ms | 1024 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>
#include <vector>
using namespace std;
vector<vector<int>> G;
vector<int> gg;
vector<int> labels;
int id=0;
void dfs(int node,int pad){
labels[node]=id;
id++;
for(auto i:G[node]){
if(i==pad)continue;
dfs(i,node);
}
}
vector<int> label(int n, int k,vector<int> u,vector<int> v) {
G.clear();
id=0;
G.assign(n+10,vector<int>());
for(int i=0;i<u.size();i++){
G[u[i]].push_back(v[i]);
G[v[i]].push_back(u[i]);
}
int piv=0;
labels.assign(n,0);
for(int i=0;i<n;i++){
if(G[i].size()==1){
dfs(piv,-1);
break;
}
}
return labels;
}
int find_next_station(int s, int t,vector<int> c) {
if(int(c.size())==1)return c[0];
if(s<t)return max(c[0],c[1]);
else return min(c[0],c[1]);
}
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... |