제출 #309706

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
309706		rrrr10000	기지국 (IOI20_stations)	C++14	0 / 100	2 ms	384 KiB

stations

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}

#include "stations.h"

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> ans(n);
	vvi g(n);
    rep(i,n-1){
        g[u[i]].pb(v[i]);
        g[v[i]].pb(u[i]);
    }
    outvv(g);
    ll cnt=0;
    vp r(n,P(inf,-inf));
    function<void(ll,ll,ll)> dfs=[&](ll i,ll p,ll dep){
        for(ll x:g[i])if(x!=p){
            dfs(x,i,dep+1);
            chmin(r[i].fi,r[x].fi);
            chmax(r[i].se,r[x].se);
        }
        if(g[i].size()==1&&p!=-1){
            ans[i]=cnt;cnt+=n*2;
            r[i]=P(ans[i],ans[i]);
        }
        else if(dep%2)ans[i]=(++r[i].se);
        else ans[i]=(--r[i].fi);
    };
    dfs(0,-1,0);
    vector<int> s=ans;
    sort(all(s));
    rep(i,n)ans[i]=lb(s,ans[i]);
	return ans;
}

int find_next_station(int s, int t, std::vector<int> c) {
    if(c.size()==1)return c[0];
	bool mi=true;
    for(ll x:c)if(s>x)mi=false;
    if(mi){
        if(t<s||t>c[c.size()-2])return c.back();
        return *lower_bound(all(c),t);
    }
    if(t>s||t<c[1])return c[0];
    return c[ub(c,t)-1];
}

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