Submission #1074668

#	Time	Username	Problem	Language	Result	Execution time	Memory
1074668		pan	Stations (IOI20_stations)	C++17	100 / 100	641 ms	1196 KiB

stations

#include <bits/stdc++.h>
//#include "bits_stdc++.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
using namespace std;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> piii;

vector<vector<ll> > adj;
vector<ll> m;
ll stfu;
vector<int> in;

void dfs(ll x, ll p = -1)
{
	if (m[x]) in[x] = ++stfu;
	for (ll u: adj[x]) if (u!=p) {m[u] = !m[x]; dfs(u, x);}
	if (!m[x]) in[x] = ++stfu;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v)
{
	adj.clear();
	adj.resize(n);
	m.resize(n);
	in.assign(n, 0);
	for (ll i=0; i<n-1; ++i)
	{
		adj[u[i]].pb(v[i]);
		adj[v[i]].pb(u[i]);
	}
	stfu = -1;
	m[0] = 0;
	dfs(0);
	return in;
	
}
int find_next_station(int s, int t, std::vector<int> c)
{
	if (s < c[0]) // case 1: post-pre-post
	{
		if (t >= c.back() || t < s) return c.back();
		return *lb(all(c), t);
	}
	else // case 2: pre-post-pre
	{
		if (t > s || t <= c[0] ) return c[0];
		return *prev(ub(all(c), t));
	}
}

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