Submission #1292999

#	Time	Username	Problem	Language	Result	Execution time	Memory
1292999		blackscreen1	Stations (IOI20_stations)	C++20	100 / 100	392 ms	620 KiB

stations

#include "stations.h"
#include <bits//stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
#define ll long long
#define ld long double
#define iloop(m, h) for (auto i = m; i != h; i += (m < h ? 1 : -1))
#define jloop(m, h) for (auto j = m; j != h; j += (m < h ? 1 : -1))
#define kloop(m, h) for (auto k = m; k != h; k += (m < h ? 1 : -1))
#define lloop(m, h) for (auto l = m; l != h; l += (m < h ? 1 : -1))
#define iloop_(m, h, g) for (auto i = m; i < h; i += g)
#define jloop_(m, h, g) for (auto j = m; j < h; j += g)
#define kloop_(m, h, g) for (auto k = m; k < h; k += g)
#define lloop_(m, h, g) for (auto l = m; l < h; l += g)
#define getchar_unlocked _getchar_nolock // comment before submission
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define pllll pair<pll, pll>
#define vll vector<ll>
#define qll queue<ll>
#define dll deque<ll>
#define pqll priority_queue<ll>
#define gll greater<ll>
#define INF 1000000000000000
#define MOD1 1000000007
#define MOD2 998244353
#define MOD3 1000000009
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
vector<ll> adj[1005];
ll val[1005], dpt[1005], cnt = 0;
void dfs(ll nd, ll pr, ll dp) {
	dpt[nd] = dp;
	if (dp%2 == 0) val[nd] = cnt++;
	for (auto it : adj[nd]) if (it != pr) dfs(it, nd, dp+1);
	if (dp%2 == 1) val[nd] = cnt++;
}

vector<int> label(int n, int k, vector<int> u, vector<int> v) {
	memset(dpt, 0, sizeof(dpt));
	memset(val, -1, sizeof(val));
	iloop(0, n) adj[i].clear();
	cnt = 0;
	iloop(0, n-1) {
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	dfs(0, -1, 0);
	vector<int> res;
	iloop(0, n) res.push_back(val[i]);
	return res;
}

int find_next_station(int s, int t, vector<int> c) {
	if (s < c[0]) {
		// s in
		if (t >= c.back() || t < s) return c.back();
		return *lower_bound(c.begin(), c.end(), t);
	}
	else {
		if (t < c.front() || t > s) return c.front();
		c.push_back(1e9);
		return *(upper_bound(c.begin(), c.end(), t) - 1);
	}
}

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