Submission #1229430

#	Time	Username	Problem	Language	Result	Execution time	Memory
1229430		Rokas159	Stations (IOI20_stations)	C++20	100 / 100	310 ms	608 KiB

stations

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

vector<vector<int>> adj;
vector<int> labels;
vector<bool> vis;
int cnt = 0;

void dfs(int v, bool b = false) {
	vis[v] = true;
	if (b) {
		labels[v] = cnt++;
	}
	for (int u : adj[v]) {
		if (!vis[u]) {
			dfs(u, !b);
		}
	}
	if (!b) {
		labels[v] = cnt++;
	}
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	adj.assign(n, {});
	labels.resize(n);
	vis.assign(n, false);
	cnt = 0;

	for (int i = 0; i < u.size(); i++) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}

	dfs(0);

	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	if (s > c[0]) {
		// current is biggest

		if (t > s || t < c[0]) {
			return c[0];
		}

		auto it = upper_bound(c.begin(), c.end(), t);
		if (it != c.begin()) {
			it--;
		}

		return *it;
	} else {
		// current is smallest

		if (t < s || t > c.back()) {
			return c.back();
		}

		auto it = lower_bound(c.begin(), c.end(), t);
		if (it == c.end()) {
			it--;
		}
		return *it;
	}
}

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