제출 #361831

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
361831		ryansee	기지국 (IOI20_stations)	C++14	36.23 / 100	1065 ms	1112 KiB

stations

#include "stations.h"

#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)

vector<int> label(int n, int k, vector<int> U, vector<int> V) {
	vector<vector<int>> v(n, vector<int>());
	FOR(i,0,n-2) v[U[i]].eb(V[i]), v[V[i]].eb(U[i]);
	vector<int> st(n, 0), en(n, 0);
	int co = 0;
	function<void(int,int)>dfs=[&](int x,int p){
		st[x]=co++;
		for(auto i:v[x]) if(i^p) dfs(i, x);
		en[x]=co-1;
	};
	dfs(0, 0);
	vector<int> C(n);
	FOR(i,0,n-1) { //(pre, post)
		if(st[i] ^ en[i]) C[i] = st[i] + (en[i] << 10);
		else C[i] = st[i];
	}
	return C;
}
int pre(int x) {
	return x & ((1<<10) - 1);
}
int post(int x) {
	if((x >> 10) == 0) return pre(x);
	return (x >> 10);
}
int find_next_station(int S, int T, vector<int> c) {
	int s[2] = {pre(S), post(S)};
	int t[2] = {pre(T), post(T)};
	if(t[0] <= s[0] && t[1] >= s[1]) { // t is part of s
		for(auto i:c) if(pre(i) < s[0]) return i;
	} else if(s[0] <= t[0] && s[1] >= t[1]) {
		for(auto i:c) if(pre(i) <= t[0] && post(i) >= t[1] && pre(i) > s[0]) {
			return i;
		}
	} else {
		for(auto i:c) if(pre(i) < s[0]) return i;
	}
	assert(0);
}

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