제출 #1077234

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1077234		steveonalex	Pinball (JOI14_pinball)	C++17	100 / 100	131 ms	16584 KiB

pinball

// #include "aliens.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const ll INF = 1e18 + 69;

struct SegmentTree{
    int n;
    vector<ll> a;

    SegmentTree(int _n){
        n = _n;
        a.resize(n * 2 + 2, INF);
    }

    void update(int i, ll v){
        i += n; if (!minimize(a[i], v)) return;
        while(i > 1){
            i >>= 1;
            a[i] = min(a[i * 2], a[i * 2 + 1]);
        }
    }

    ll get(int l, int r){
        l += n; r += n + 1;
        ll ans = INF;
        while(l < r){
            if (l & 1) minimize(ans, a[l++]);
            if (r & 1) minimize(ans, a[--r]);
            l >>= 1; r >>= 1;
        }
        return ans;
    }
};

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n, m; cin >> n >> m;
    vector<array<int, 4>> a(n);
    for(int i = 0; i<n; ++i){
        for(int &j: a[i]) cin >> j;
    }

    vector<int> b = {0, 1, m};
    for(int i = 0; i<n; ++i){
        b.push_back(a[i][0]); b.push_back(a[i][1]); b.push_back(a[i][2]);
    }
    remove_dup(b);

    for(int i = 0; i<n; ++i){
        a[i][0] = lower_bound(ALL(b), a[i][0]) - b.begin();
        a[i][1] = lower_bound(ALL(b), a[i][1]) - b.begin();
        a[i][2] = lower_bound(ALL(b), a[i][2]) - b.begin();
    }

    int k = b.size() - 1;
    SegmentTree st_left(k), st_right(k);
    st_left.update(1, 0);
    st_right.update(k, 0);

    ll ans = INF;
    for(array<int, 4> i: a){
        minimize(ans, st_left.get(i[0], i[1]) + st_right.get(i[0], i[1]) + i[3]);

        st_left.update(i[2], i[3] + st_left.get(i[0], i[1]));

        st_right.update(i[2], i[3] + st_right.get(i[0], i[1]));
    }

    if (ans == INF) cout << -1 << "\n";
    else cout << ans << "\n";
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

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