Submission #584599

#	Time	Username	Problem	Language	Result	Execution time	Memory
584599		drdilyor	Pinball (JOI14_pinball)	C++17	100 / 100	436 ms	37564 KiB

pinball

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#ifdef ONPC
    #include "t_debug.cpp"
#else
    #define debug(...) 42
#endif
#define allit(a) (a).begin(), (a).end()
#define sz(a) ((int) (a).size())
#define cut(s) {cout << s << '\n'; return 0;}

using namespace std;
using ll = long long;
using vi = vector<int>;
namespace pd = __gnu_pbds;
template<typename K> using ordered_set = pd::tree<K, pd::null_type, less<K>, pd::rb_tree_tag, pd::tree_order_statistics_node_update>;
template<typename... T> using hash_table = pd::gp_hash_table<T...>;

const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rng(RANDOM);
const int INF = 1e9;
const ll INFL = 1e18;
const int N = 1000;
const int M = 10;

struct device {
    int left, right, center, cost;
};
ostream& operator <<(ostream& os, device& a) {
    return os << "{" << a.left << "," << a.right << ", " << a.center << " $" << a.cost << "}";
}

struct SegTree {
    int n;
    vector<ll> tree;
    SegTree(int n) : n(n), tree(2*n, INFL) {}
    void update(int i, ll v) {
        i += n;
        tree[i] = min(tree[i], v);
        for (i /= 2; i >= 1; i /= 2) tree[i] = min(tree[i*2], tree[i*2+1]);
    }
    ll query(int l, int r) {
        l += n;
        r += n;
        ll res = INFL;
        while (l <= r) {
            if (l % 2 == 1) res = min(res, tree[l++]);
            if (r % 2 == 0) res = min(res, tree[r--]);
            l /= 2; r /= 2;
        }
        return res;
    }
};

int nextPower2(int x) {
    x --;
    x |= x >> 1;
    x |= x >> 2;
    x |= x >> 4;
    x |= x >> 8;
    x |= x >> 16;
    return 1+x;
}

int solve() {
    int n, m;
    cin >> m >> n;
    vector<device> dev(m);

    for (int i = 0; i < m; i++) {
        cin >> dev[i].left >> dev[i].right >> dev[i].center >> dev[i].cost;
    }

    {
        //compress
        ordered_set<ll> values;
        for (int i = 0; i < m; i++) {
            values.insert(dev[i].left);
            values.insert(dev[i].right);
            values.insert(dev[i].center);
        }
        values.insert(1);
        values.insert(n);
        for (int i = 0; i < m; i++) {
            dev[i].left = values.order_of_key(dev[i].left);
            dev[i].right = values.order_of_key(dev[i].right);
            dev[i].center = values.order_of_key(dev[i].center);
        }
        n = values.order_of_key(n);
    }

    SegTree mnLeft(nextPower2(n+1)), mnRight(nextPower2(n+1));

    function<ll(int)> dpLeft = [&](int i) {
        ll res = INFL;
        if (dev[i].left == 0) res = (ll)dev[i].cost;
        else
            res = dev[i].cost + mnLeft.query(dev[i].left, dev[i].right);
        mnLeft.update(dev[i].center, res);
        return res;
    };

    function<ll(int)> dpRight = [&](int i) {
        ll res = INFL;
        if (dev[i].right == n) res = dev[i].cost;
        else
            res = dev[i].cost + mnRight.query(dev[i].left, dev[i].right);
        mnRight.update(dev[i].center, res);
        return res;
    };

    ll res = INFL;
    for (int i = 0; i < m; i++) {
        ll l = dpLeft(i), r = dpRight(i);
        if (l < INFL && r < INFL)
            res = min(res, l + r - dev[i].cost);
    }
    cout << (res >= INFL ? -1 : res);

    return 0;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    //cin >> t;
    while (t-- && cin) {
        if (solve()) break;
        #ifdef ONPC
            cout << "____________________" << endl;
        #endif
    }
    return 0;
}

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