Submission #421629

#	Time	Username	Problem	Language	Result	Execution time	Memory
421629		ja_kingy	Stations (IOI20_stations)	C++14	100 / 100	1240 ms	780 KiB

stations

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

int cnt;
vector<int> adj[1000], labels;
void dfs(int u, int p, bool tp) {
	if (!tp) labels[u] = cnt++;
	for (int v: adj[u]) if (v != p) {
		dfs(v, u, 1-tp);
	}
	if (tp) labels[u] = cnt++;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	cnt = 0;
	labels.resize(n);
	for (int i = 0; i < n; ++i) adj[i].clear();
	for (int i = 0; i < n-1; ++i) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	dfs(0, 0, 0);
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	sort(c.begin(), c.end());
	if (s <= c.front()) {
		if (t < s) return c.back();
		auto it = lower_bound(c.begin(), c.end(), t);
		if (it == c.end()) return c.back();
		else return *it;
	} else {
		if (t > s) return c.front();
		auto it = upper_bound(c.begin(), c.end(), t);
		if (it == c.begin()) return *it;
		else return *(--it);
	}
	return c[0];
}

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