oj.uz

답안 #371040

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
371040 2021-02-25T16:19:44 Z maroonrk 기지국 (IOI20_stations) C++17
100 / 100
 1126 ms 1248 KB 
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;

using ll=long long;
//#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t,class u>
void print(const pair<t,u>&p,int suc=1){
	print(p.a,2);
	print(p.b,suc);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

std::vector<int> label(int n, int, std::vector<int> us, std::vector<int> vs){
	vvc<int> t(n);
	rep(i,n-1){
		t[us[i]].pb(vs[i]);
		t[vs[i]].pb(us[i]);
	}
	int head=0;
	vi res(n);
	auto rec=[&](auto self,int v,int p,int d)->void{
		if(d%2==0)res[v]=head++;
		for(auto to:t[v])if(to!=p){
			self(self,to,v,d+1);
		}
		if(d%2==1)res[v]=head++;
	};
	rec(rec,0,-1,0);
	return res;
}

int find_next_station(int s, int t, std::vector<int> c){
	sort(all(c));
	if(binary_search(all(c),t))return t;
	if(s==0){
		return *lower_bound(all(c),t);
	}else if(s<c[0]){
		int par=c.back();
		c.pop_back();
		c.insert(c.bg,s);
		int i=lwb(c,t);
		if(i==0||i==si(c))return par;
		else return c[i];
	}else if(c.back()<s){
		int par=c[0];
		c.erase(c.bg);
		c.pb(s);
		int i=lwb(c,t);
		if(i==0||i==si(c))return par;
		else return c[i-1];
	}else assert(false);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 556 ms 884 KB Output is correct
2 Correct 514 ms 884 KB Output is correct
3 Correct 1126 ms 756 KB Output is correct
4 Correct 799 ms 864 KB Output is correct
5 Correct 636 ms 864 KB Output is correct
6 Correct 612 ms 968 KB Output is correct
7 Correct 553 ms 884 KB Output is correct
8 Correct 3 ms 736 KB Output is correct
9 Correct 4 ms 736 KB Output is correct
10 Correct 1 ms 756 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 480 ms 748 KB Output is correct
2 Correct 632 ms 756 KB Output is correct
3 Correct 1005 ms 864 KB Output is correct
4 Correct 670 ms 992 KB Output is correct
5 Correct 585 ms 864 KB Output is correct
6 Correct 546 ms 756 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 634 ms 1248 KB Output is correct
2 Correct 542 ms 884 KB Output is correct
3 Correct 900 ms 864 KB Output is correct
4 Correct 726 ms 864 KB Output is correct
5 Correct 625 ms 736 KB Output is correct
6 Correct 473 ms 864 KB Output is correct
7 Correct 492 ms 884 KB Output is correct
8 Correct 3 ms 872 KB Output is correct
9 Correct 4 ms 864 KB Output is correct
10 Correct 2 ms 736 KB Output is correct
11 Correct 632 ms 736 KB Output is correct
12 Correct 480 ms 1048 KB Output is correct
13 Correct 539 ms 980 KB Output is correct
14 Correct 488 ms 920 KB Output is correct
15 Correct 58 ms 884 KB Output is correct
16 Correct 69 ms 736 KB Output is correct
17 Correct 107 ms 1012 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 927 ms 864 KB Output is correct
2 Correct 782 ms 864 KB Output is correct
3 Correct 676 ms 736 KB Output is correct
4 Correct 3 ms 912 KB Output is correct
5 Correct 4 ms 736 KB Output is correct
6 Correct 1 ms 736 KB Output is correct
7 Correct 664 ms 864 KB Output is correct
8 Correct 870 ms 756 KB Output is correct
9 Correct 701 ms 736 KB Output is correct
10 Correct 709 ms 756 KB Output is correct
11 Correct 6 ms 992 KB Output is correct
12 Correct 6 ms 736 KB Output is correct
13 Correct 3 ms 872 KB Output is correct
14 Correct 5 ms 884 KB Output is correct
15 Correct 2 ms 864 KB Output is correct
16 Correct 544 ms 756 KB Output is correct
17 Correct 499 ms 884 KB Output is correct
18 Correct 510 ms 736 KB Output is correct
19 Correct 590 ms 756 KB Output is correct
20 Correct 568 ms 864 KB Output is correct

Subtask #5
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 547 ms 884 KB Output is correct
2 Correct 509 ms 952 KB Output is correct
3 Correct 986 ms 844 KB Output is correct
4 Correct 709 ms 864 KB Output is correct
5 Correct 622 ms 892 KB Output is correct
6 Correct 489 ms 948 KB Output is correct
7 Correct 493 ms 992 KB Output is correct
8 Correct 3 ms 756 KB Output is correct
9 Correct 5 ms 736 KB Output is correct
10 Correct 1 ms 736 KB Output is correct
11 Correct 574 ms 884 KB Output is correct
12 Correct 511 ms 756 KB Output is correct
13 Correct 973 ms 864 KB Output is correct
14 Correct 705 ms 1004 KB Output is correct
15 Correct 681 ms 872 KB Output is correct
16 Correct 450 ms 792 KB Output is correct
17 Correct 589 ms 1060 KB Output is correct
18 Correct 541 ms 1024 KB Output is correct
19 Correct 469 ms 864 KB Output is correct
20 Correct 442 ms 896 KB Output is correct
21 Correct 67 ms 856 KB Output is correct
22 Correct 68 ms 816 KB Output is correct
23 Correct 125 ms 792 KB Output is correct
24 Correct 5 ms 872 KB Output is correct
25 Correct 4 ms 736 KB Output is correct
26 Correct 4 ms 756 KB Output is correct
27 Correct 3 ms 796 KB Output is correct
28 Correct 2 ms 756 KB Output is correct
29 Correct 484 ms 884 KB Output is correct
30 Correct 524 ms 1012 KB Output is correct
31 Correct 525 ms 756 KB Output is correct
32 Correct 574 ms 756 KB Output is correct
33 Correct 521 ms 864 KB Output is correct
34 Correct 358 ms 884 KB Output is correct
35 Correct 539 ms 920 KB Output is correct
36 Correct 614 ms 884 KB Output is correct
37 Correct 605 ms 1000 KB Output is correct
38 Correct 552 ms 1000 KB Output is correct
39 Correct 489 ms 1224 KB Output is correct
40 Correct 444 ms 1120 KB Output is correct
41 Correct 459 ms 992 KB Output is correct
42 Correct 67 ms 812 KB Output is correct
43 Correct 100 ms 736 KB Output is correct
44 Correct 181 ms 736 KB Output is correct
45 Correct 193 ms 788 KB Output is correct
46 Correct 285 ms 1152 KB Output is correct
47 Correct 310 ms 996 KB Output is correct
48 Correct 62 ms 864 KB Output is correct
49 Correct 70 ms 736 KB Output is correct