제출 #787721

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
787721		raysh07	Pinball (JOI14_pinball)	C++17	100 / 100	129 ms	15932 KiB

pinball

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
 
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
 
template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}
 
template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}
 
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
 
/*
 
 
 
*/
 
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
 
template<typename T>
struct segtree {
    // https://codeforces.com/blog/entry/18051
 
    /*=======================================================*/
 
    struct data {
        ll a;
    };
 
    data neutral = {inf2};
 
    data merge(data &left, data &right) {
        data curr;
        curr.a = min(left.a,right.a);
        return curr;
    }
 
    void create(int i, T v) {
        tr[i].a = v;
    }
 
    void modify(int i, T v) {
        amin(tr[i].a, v);
    }
 
    /*=======================================================*/
 
    int n;
    vector<data> tr;
 
    segtree() {
 
    }
 
    segtree(int siz) {
        init(siz);
    }
 
    void init(int siz) {
        n = siz;
        tr.assign(2 * n, neutral);
    }
 
    void build(vector<T> &a, int siz) {
        rep(i, siz) create(i + n, a[i]);
        rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }
 
    void pupd(int i, T v) {
        modify(i + n, v);
        for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }
 
    data query(int l, int r) {
        data resl = neutral, resr = neutral;
 
        for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) resl = merge(resl, tr[l++]);
            if (!(r & 1)) resr = merge(tr[r--], resr);
        }
 
        return merge(resl, resr);
    }
};
 
void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    vector<array<ll,4>> a(n+5);
 
    for(int i = 3; i <= n+2; ++i){
        rep(j,4){
            cin >> a[i][j];
        }
    }
 
    a[1] = {1,1,1,0};
    a[2] = {m,m,m,0};
 
    vector<ll> b;
    rep1(i,n+2){
        rep(j,3){
            b.pb(a[i][j]);
        }
    }
 
    sort(all(b));
    b.resize(unique(all(b))-b.begin());
    ll siz = sz(b);
 
    rep1(i,n+2){
        rep(j,3){
            a[i][j] = lower_bound(all(b),a[i][j]) - b.begin();
        }
    }
 
    auto go = [&](ll src, vector<ll> &dp){
        segtree<ll> st(siz+5);
        
        {
            ll k = a[src][2];
            st.pupd(k,0);
        }
 
        for(int i = 3; i <= n+2; ++i){
            auto [l,r,k,w] = a[i];
            dp[i] = st.query(l,r).a + w;
            st.pupd(k,dp[i]);
        }
    };
 
    vector<ll> dp1(n+5,inf2), dp2(n+5,inf2);
    go(1,dp1);
    go(2,dp2);
 
    ll ans = inf2;
 
    for(int i = 3; i <= n+2; ++i){
        ll cost = dp1[i] + dp2[i] - a[i][3];
        amin(ans,cost);
    }
 
    if(ans == inf2) ans = -1;
    cout << ans << endl;
}
 
int main()
{
    fastio;
 
    int t = 1;
    // cin >> t;
 
    rep1(i, t) {
        solve(i);
    }
 
    return 0;
}

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