Submission #849861

#	Time	Username	Problem	Language	Result	Execution time	Memory
849861		abcvuitunggio	Stations (IOI20_stations)	C++17	0 / 100	3088 ms	2097152 KiB

stations

#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)];
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 16
• Subtask 4: 0 / 10
• Subtask 5: 0 / 61