제출 #328842

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
328842		dolphingarlic	기지국 (IOI20_stations)	C++14	0 / 100	3060 ms	2097156 KiB

stations

#include "stations.h"
#include <vector>
#include <algorithm>

std::vector<int> graph[1000];
bool even[1000];
int tin[1000], tout[1000], timer = 0;

void dfs(int node = 0, int parent = -1, bool even = true) {
	tin[node] = timer++;
	::even[node] = even;
	for (int i : graph[node]) if (i != parent) dfs(i, node, !even);
	tout[node] = timer++;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	for (int i = 0; i < n - 1; i++) {
		graph[u[i]].push_back(v[i]);
		graph[v[i]].push_back(u[i]);
	}
	dfs();
	std::vector<int> labels(n);
	for (int i = 0; i < n; i++) labels[i] = (even[i] ? tin[i] : tout[i]) / 2;
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	int mx = *std::max_element(c.begin(), c.end());
	int mn = *std::min_element(c.begin(), c.end());
	if (s < mn) {
		if (t < s || t > mx) return mx;
		return *std::lower_bound(c.begin(), c.end(), t);
	} else {
		if (t > s || t < mn) return mn;
		return *prev(std::upper_bound(c.begin(), c.end(), t));
	}
}

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