Submission #958561

#	Time	Username	Problem	Language	Result	Execution time	Memory
958561		horiseun	Stations (IOI20_stations)	C++17	0 / 100	580 ms	1068 KiB

stations

#include <iostream>
#include <vector>
#include <algorithm>
#include "stations.h"
using namespace std;

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<vector<int>> adj(n, vector<int>(0));
	for (int i = 0; i < n - 1; i++) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	vector<int> in(n, 0);
	int idx = 0;
	function<void(int, int)> dfs = [&] (int curr, int par) {
		in[curr] = idx++;
		for (int i : adj[curr]) {
			if (i == par) continue;
			dfs(i, curr);
		}
	};
	dfs(0, -1);
	return in;
}

int find_next_station(int s, int t, vector<int> c) {
	for (int i : c) {
		if (i == t) return i;
		if (i >= min(s, t) && i <= max(s, t)) return i;
	}
	return -1;
}

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