Submission #617351

#	Time	Username	Problem	Language	Result	Execution time	Memory
617351		DanShaders	Stations (IOI20_stations)	C++17	0 / 100	811 ms	732 KiB

stations

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

#define x first
#define y second
using ll = long long;
using ld = long double;
#define all(x) begin(x), end(x)
#define sz(x) ((int) (x).size())

const int N = 1010;

vector<int> g[N];
vector<int> ans;
int timer = 0;

void dfs(int u = 0, int p = -1, int depth = 1) {
	if (depth) {
		ans[u] = timer++;
	}
	for (int v : g[u]) {
		if (v != p) {
			dfs(v, u, depth ^ 1);
		}
	}
	if (!depth) {
		ans[u] = timer++;
	}
}

vector<int> label(int n, int, vector<int> u, vector<int> v) {
	for (int i = 0; i < n; ++i) {
		g[i].clear();
	}
	timer = 0;
	for (int i = 0; i < n - 1; ++i) {
		g[u[i]].push_back(v[i]);
		g[v[i]].push_back(u[i]);
	}
	ans.resize(n);
	dfs();
	return ans;
}

int find_next_station(int s, int t, vector<int> c) {
	// if (sz(c) == 1) {
	// 	return c[0];
	// }
	// if (!s) {
	// 	return *lower_bound(all(c), t);
	// }
	// if (s < c[0]) {
	// 	if (t < s || t > c[sz(c) - 2]) {
	// 		return c.back();
	// 	} else {
	// 		return *lower_bound(all(c), t);
	// 	}
	// } else {
	// 	if (t < c[1] || t > s) {
	// 		return c[0];
	// 	} else {
	// 		return *--upper_bound(all(c), t);
	// 	}
	// }
	return c[0];
}

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