제출 #849861

#제출 시각아이디문제언어결과실행 시간메모리
849861abcvuitunggio기지국 (IOI20_stations)C++17
0 / 100
3088 ms2097152 KiB
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> tin,ke[1001];
int t;
void dfs(int u, int p){
    tin[u]=++t;
    for (int v:ke[u])
        if (v!=p)
            dfs(v,u);
}
vector <int> label(int n, int k, vector <int> u, vector <int> v){
	tin.resize(n);
	for (int i=0;i<n-1;i++){
        ke[u[i]].push_back(v[i]);
        ke[v[i]].push_back(u[i]);
	}
	dfs(0,0);
	return tin;
}
int find_next_station(int s, int t, vector <int> c){
    return c[(t<s?0:upper_bound(c.begin(),c.end(),t)-c.begin()-1)];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...