Submission #387392

#	Time	Username	Problem	Language	Result	Execution time	Memory
387392		ZikXewen	기지국 (IOI20_stations)	C++17	0 / 100	2572 ms	2097156 KiB

stations

#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int X = 1005;
vector<int> ed[X];
bool lv[X];
int num;
void dfs(int u, int p, vector<int> &lb){
	lv[u] = !lv[p];
	if(lv[u]) lb[u] = num++;
	for(int v: ed[u]) if(v != p) dfs(v, u, lb);
	if(!lv[u]) lb[u] = num++;
}
vector<int> label(int N, int K, vector<int> ar1, vector<int> ar2) {
	vector<int> lb(N);
	for(int i = 0; i < N - 1; ++i) ed[ar1[i]].emplace_back(ar2[i]), ed[ar2[i]].emplace_back(ar1[i]);
	dfs(0, 0, lb);
	return lb;
}
int find_next_station(int s, int t, vector<int> c) {
	if(c.size() == 1) return c[0];
	sort(c.begin(), c.end());
	if(c[0] < s){
		if(t < c[1] or t > s) return c[0];
		return *(upper_bound(c.begin(), c.end(), t) - 1);
	} else {
		if(t > c[c.size() - 2] or t < s) return c.back();
		return *lower_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