Submission #1052447

#	Time	Username	Problem	Language	Result	Execution time	Memory
1052447		dozer	Stations (IOI20_stations)	C++14	52.32 / 100	501 ms	1204 KiB

stations

#include "stations.h"
#include<bits/stdc++.h>
using namespace std;
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define sp " "
#define endl "\n"
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
#define ll long long
#define LL node * 2
#define RR node * 2 + 1
#define N 1005

const int modulo = 1e9 + 7;
const ll INF = 2e18 + 7;
const int m = 1000;

int l[N], tin[N], tout[N];
int cntr = 0;
vector<int> adj[N];

void dfs(int node, int root){
	tin[node] = ++cntr;
	for (auto i : adj[node]){
		if (i != root) dfs(i, node);
	}
	tout[node] = cntr;
}


vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	vector<int> labels(n);
	for (int i = 0; i < n; i++)
		adj[i].clear();

	for (int i = 0; i < n - 1; i++){
		adj[u[i]].pb(v[i]);
		adj[v[i]].pb(u[i]);
	}
	cntr = -1;
	int root = 0;
	for (int i = 0; i < n; i++) if (adj[i].size() == 1) root = i;
	dfs(root, -1);

	for (int i = 0; i < n; i++) {
		labels[i] = tin[i] + tout[i] * m;
		//cout<<i<<sp<<tin[i]<<sp<<tout[i]<<sp<<labels[i]<<endl;
	}
	return labels;
}

int find_next_station(int s, int t, vector<int> c) {
	int in = t % m, out = t / m;
	sort(c.begin(), c.end(), [&](int a, int b){
		int ina = a % m, inb = b % m;
		int outa = a / m, outb = b / m;
		if (ina >= inb && outa <= outb) return true;
		if (ina <= inb && outa >= outb) return false;
		return ina < inb;
	});



	for (auto i : c){
		int in2 = i % m, out2 = i / m;
		if (in2 <= in && out2 >= out) return i; 
	}
	return c.back();
	
}
/*


static int max_label = 0;
static int r, n, k, q;
static std::vector<int> u, v, labels, answers;
static std::map<int, int> reverse_labels;
static std::vector<std::vector<int>> adjlist;
static int s, t, w;
static std::vector<int> c;

int main() {
	fileio();
	assert(scanf("%d", &r) == 1);
	for (int tc = 0; tc < r; tc++) {
		assert(scanf("%d%d", &n, &k) == 2);
		u.resize(n - 1);
		v.resize(n - 1);
		adjlist.clear();
		adjlist.resize(n);
		for (int i = 0; i < n - 1; i++) {
			assert(scanf("%d%d", &u[i], &v[i]) == 2);
			adjlist[u[i]].push_back(v[i]);
			adjlist[v[i]].push_back(u[i]);
		}
		labels = label(n, k, u, v);
		if ((int)labels.size() != n) {
			printf("Number of labels not equal to %d\n", n);
			exit(0);
		}
		reverse_labels.clear();
		for (int i = 0; i < n; i++) {
			if (labels[i] < 0 || labels[i] > k) {
				printf("Label not in range 0 to %d\n", k);
				exit(0);
			}
			if (reverse_labels.find(labels[i]) != reverse_labels.end()) {
				printf("Labels not unique\n");
				exit(0);
			}
			reverse_labels[labels[i]] = i;
			if (labels[i] > max_label) {
				max_label = labels[i];
			}
		}
		assert(scanf("%d", &q) == 1);
		for (int i = 0; i < q; i++) {
			assert(scanf("%d%d%d", &s, &t, &w) == 3);
			c.clear();
			for (int v : adjlist[s]) {
				c.push_back(labels[v]);
			}
			std::sort(c.begin(), c.end());
			int answer = find_next_station(labels[s], labels[t], c);
			if (!std::binary_search(c.begin(), c.end(), answer)) {
				printf("Label %d returned by find_next_station not found in c\n", answer);
				exit(0);
			}
			answers.push_back(reverse_labels[answer]);
		}
	}
	printf("%d\n", max_label);
	for (int index : answers) {
		printf("%d\n", index);
	}
	exit(0);
}
*/

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