Submission #377788

#	Time	Username	Problem	Language	Result	Execution time	Memory
377788		rrrr10000	Pinball (JOI14_pinball)	C++14	100 / 100	515 ms	30424 KiB

pinball

#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 pb 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 all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#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;
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 outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
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;}

class segtree{
    ll N=1;
    vi seg;
public:
    segtree(ll n){
        while(N<n)N*=2;
        seg=vi(N*2-1,inf);
    }
    void update(ll i,ll x){
        i+=N-1;
        chmin(seg[i],x);
        while(i>0){
            i=(i-1)>>1;
            seg[i]=min(seg[i*2+1],seg[i*2+2]);
        }
    }
    ll get(ll a,ll b,ll k=0,ll l=0,ll r=-1){
        if(r==-1)r=N;
        if(a<=l&&r<=b)return seg[k];
        if(r<=a||b<=l)return inf;
        return min(get(a,b,k*2+1,l,(l+r)>>1),get(a,b,k*2+2,(l+r)>>1,r));
    }
};
int main(){
    ll n,k;cin>>n>>k;
    vvi v(n,vi(4));
    vi srt;
    rep(i,n){
        rep(j,4)cin>>v[i][j];
        rep(j,3)srt.pb(v[i][j]);
    }
    srt.pb(1);srt.pb(k);
    dupli(srt);
    segtree seg1(srt.size()),seg2(srt.size());
    seg1.update(0,0);
    seg2.update(srt.size()-1,0);
    ll ans=inf;
    rep(i,n){
        ll ml=seg1.get(lb(srt,v[i][0]),lb(srt,v[i][1])+1);
        ll mr=seg2.get(lb(srt,v[i][0]),lb(srt,v[i][1])+1);
        chmin(ans,ml+mr+v[i][3]);
        seg1.update(lb(srt,v[i][2]),ml+v[i][3]);
        seg2.update(lb(srt,v[i][2]),mr+v[i][3]);
    }
    outs(ans,-1);
}

• Subtask 1: 11 / 11
• Subtask 2: 18 / 18
• Subtask 3: 22 / 22
• Subtask 4: 49 / 49