Submission #1199928

#	Time	Username	Problem	Language	Result	Execution time	Memory
1199928		Belphegor	Stations (IOI20_stations)	C++20	100 / 100	317 ms	592 KiB

stations

#include <bits/stdc++.h>
using namespace std;
int counter;
int L[1005],R[1005];
vector<int>tree[1005];
vector<int>labels;
void dfs(int cur,int par,int d){
	if(!d) labels[cur] = ++counter;
	for(int nxt : tree[cur]){
		if(nxt == par) continue;
		dfs(nxt,cur,d^1);
	}
	if(d) labels[cur] = ++counter;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	labels = vector<int>(n,-1);
	counter = -1;
	for(int i=0; i<n; i++) tree[i].clear();
	for(int i=0; i<u.size(); i++){
		int a = u[i],b = v[i];
		tree[a].emplace_back(b);
		tree[b].emplace_back(a);
	}
	dfs(0,-1,0);
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if(c.size() == 1) return c[0];
	sort(c.begin(),c.end());
	if(c[0] < s){
		if(c[1] <= t && t <= s){
			c.emplace_back(s);
			for(int i=1; i<c.size()-1; i++){
				if(t < c[i+1]) return c[i];
			}
		}
		return c[0];
	}
	else{
		int parent = c.back(); c.pop_back();
		int p = s;
		for(int x : c){
			if(p < t && t <= x) return x;
			p = x;
		}
		return parent;
	}
}

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