Submission #305456

#	Time	Username	Problem	Language	Result	Execution time	Memory
305456		myungwoo	Stations (IOI20_stations)	C++17	69.87 / 100	918 ms	1172 KiB

stations

#include <bits/stdc++.h>
#include "stations.h"
using namespace std;

vector<int> label(int N, int K, vector<int> u, vector<int> v)
{
	vector<vector<int>> con(N);
	for (int i=0;i<N-1;i++)
		con[u[i]].push_back(v[i]),
		con[v[i]].push_back(u[i]);

	vector<int> labels(N);
	function<void(int, int)> dfs;
	dfs = [&](int n, int p){
		static int idx = 0;
		if (p == -1 || !labels[p]) labels[n] = ++idx;
		for (int t: con[n]) if (t != p)
			dfs(t, n);
		if (labels[p]) labels[n] = ++idx;
	};
	dfs(0, -1);
	return labels;
}

int find_next_station(int s, int t, vector<int> c)
{
	if (c.back() < s) reverse(c.begin(), c.end());
	for (int x: c) if (min(s, x) <= t && t <= max(s, x)) return x;
	return c.back();
}

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