# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673947 | vjudge1 | Stations (IOI20_stations) | C++17 | 2 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 <bits/stdc++.h>
typedef long long ll;
using namespace std;
const long long mod = 1988;
const long long mxN = 2e5 + 1;
vector<int> label(int n,int k, vector<int> u, vector<int> v){
vector<vector<int>>gr;
gr.resize(int(u.size()));
for(int i = 0;i < int(u.size());i++){
gr[v[i]].push_back(u[i]);
gr[u[i]].push_back(v[i]);
}
vector<int>labels(2001);
function<void(int,int,int)> dfs = [&](int node,int par,int val){
val++;
labels[node] = val;
for(auto child : gr[node]){
if(child != par) dfs(child,node,val);
}
};
dfs(0,-1,0);
return labels;
}
int find_next_station(int s, int t, vector<int> c){
int ans = 0;
for(int i = 0;i < c.size();i++){
if(c[i] < s && t < s){
ans = c[i];
return c[i];
}
if(c[i] <= t) ans = c[i];
else return ans;
}
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... |