제출 #349731

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
349731		rrrr10000	철로 (IOI14_rail)	C++14	100 / 100	91 ms	748 KiB

rail

#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 rsort(a) {sort(all(a));reverse(all(a));}
#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 "rail.h"
void findLocation(int n,int first,int v[],int w[]){
    vp srt(n-1);
    v[0]=first;w[0]=1;
    rep(i,n-1)v[i+1]=v[0]+getDistance(0,i+1);
    rep(i,n-1)srt[i]=P(v[i+1],i+1);
    sort(all(srt));
    vp al;
    rep(i,n-1){
        ll k;
        bool ok=false;
        if(i){
            k=al.back().fi-getDistance(srt[i].se,al.back().se);
            ll l=lb(al,P(k,-1));
            if(al[l].fi*2-k==srt[i].fi)ok=true;
        }
        if(ok){
            w[srt[i].se]=1;
            v[srt[i].se]=k;
        }
        else{
            al.pb(srt[i]);
            w[srt[i].se]=2;
        }
    }
    // rep(i,n)cout<<v[i]<<' ';cout<<endl;
    // rep(i,n)cout<<w[i]<<' ';cout<<endl;
    srt=vp(0);al=vp(0);
    rep(i,n)if(v[i]<v[0])srt.pb(v[i],i);
    rsort(srt);
    // outvp(srt);
    auto comp=[&](P a,P b){return a>b;};
    rep(i,srt.size()){
        ll k;
        bool ok=false;
        if(i){
            k=al.back().fi+getDistance(srt[i].se,al.back().se);
            ll l=lower_bound(all(al),P(k,inf),comp)-al.begin();
            // out(l);
            // outvp(al);
            // cout<<al[l].fi<<' '<<k<<' '<<srt[i].fi<<endl;
            if(al[l].fi*2-k==srt[i].fi)ok=true;
        }
        if(ok){
            w[srt[i].se]=2;
            v[srt[i].se]=k;
        }
        else{
            al.pb(srt[i]);
            w[srt[i].se]=1;
        }
    }
    // rep(i,n)cout<<v[i]<<' ';cout<<endl;
    // rep(i,n)cout<<w[i]<<' ';cout<<endl;
}

• Subtask 1: 8 / 8
• Subtask 2: 22 / 22
• Subtask 3: 26 / 26
• Subtask 4: 44 / 44