제출 #673081

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
673081		pavement	기지국 (IOI20_stations)	C++17	0 / 100	916 ms	928 KiB

stations

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

#define pb push_back
#define eb emplace_back
using iii = tuple<int, int, int>;

int idx, dep[1005], pre[1005], mpre[1005];
vector<int> adj[1005];

void dfs(int n, int e = -1) {
	mpre[n] = pre[n] = ++idx;
	for (auto u : adj[n]) if (u != e) {
		dep[u] = dep[n] + 1;
		dfs(u, n);
		mpre[n] = max(mpre[n], mpre[u]);
	}
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	for (int i = 0; i < n - 1; i++) {
		adj[u[i]].pb(v[i]);
		adj[v[i]].pb(u[i]);
	}
	dfs(0);
	vector<int> labels(n);
	vector<iii> vec;
	for (int i = 0; i < n; i++) {
		if (dep[i] & 1) vec.eb(mpre[i], -dep[i], i);
		else vec.eb(pre[i], -dep[i], i);
	}
	sort(vec.begin(), vec.end());
	for (int i = 0; i < n; i++)	labels[get<2>(vec[i])] = i;
		for (int i = 0; i < n; i++) {
		adj[i].clear();
		dep[i] = pre[i] = mpre[i] = 0;
	}
	idx = 0;
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	if (s > c.back()) {
		int p = c[0] + 1;
		if (p <= t && t <= s) {
			for (int i = 1; i < (int)c.size(); i++)
				if (c[i] <= t && t < (i == (int)c.size() - 1 ? s + 1 : c[i + 1])) return c[i];
			assert(0);
		} else {
			return c[0];
		}
	} else {
		for (int i = 0; i < (int)c.size() - 1; i++)
			if ((i == 0 ? s : c[i - 1]) < t && t <= c[i]) return c[i];
		return c.back();
	}
}

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