Submission #1199916

#	Time	Username	Problem	Language	Result	Execution time	Memory
1199916		Belphegor	Stations (IOI20_stations)	C++20	0 / 100	304 ms	572 KiB

stations

#include <bits/stdc++.h>
using namespace std;
int counter;
vector<int>tree[1005];
vector<int>labels;
void dfs(int cur,int par,int 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) {
	sort(c.begin(),c.end());
	if(c[0] < s){
		c.emplace_back(s);
		for(int i=2; i<c.size(); i++){
			if(c[i-1] <= t && t < c[i]) return c[i-1];
		}
		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: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 16
• Subtask 4: 0 / 10
• Subtask 5: 0 / 61