Submission #236013

#	Time	Username	Problem	Language	Result	Execution time	Memory
236013		DS007	Pinball (JOI14_pinball)	C++14	100 / 100	455 ms	97696 KiB

pinball

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define inf 1e17

const int N = 3e5, M = 1e5;
int m, n, a[M], b[M], c[M], d[M], ans = 1e17;

struct node {
    int val;
    node *left, *right;

    node() {
        val = inf;
        left = nullptr;
        right = nullptr;
    }
};

class SegmentTree {
public:
    node *root = new node();

    int query(node *cur, int l, int r, int tl, int tr) {
        if (cur == nullptr || tl > tr)
            return inf;
        else if (l == tl && r == tr)
            return cur->val;
        int mid = (l + r) / 2;
        return min(query(cur->left, l, mid, tl, min(mid, tr)), query(cur->right, mid + 1, r, max(mid + 1, tl), tr));
    }

    void update(node *cur, int l, int r, int tl, int nv) {
        if (l == r) {
            assert(l == tl);
            cur->val = min(cur->val, nv);
            return;
        }

        int mid = (l + r) / 2;
        if (tl <= mid) {
            if (cur->left == nullptr)
                cur->left = new node();
            update(cur->left, l, mid, tl, nv);
        } else {
            if (cur->right == nullptr)
                cur->right = new node();
            update(cur->right, mid + 1, r, tl, nv);
        }
        cur->val = min(query(cur->left, l, mid, l, mid), query(cur->right, mid + 1, r, mid + 1, r));
    }
} t1, t2;

int solveTestCase(int test) {
    cin >> m >> n;
    for (int i = 0; i < m; i++) {
        cin >> a[i] >> b[i] >> c[i] >> d[i];
        int lc = a[i] == 1 ? 0 : t1.query(t1.root, 0, 1e9, a[i], b[i]);
        int rc = b[i] == n ? 0 : t2.query(t2.root, 0, 1e9, a[i], b[i]);
        ans = min(ans, lc + rc + d[i]);

        t1.update(t1.root, 0, 1e9, c[i], lc + d[i]);
        t2.update(t2.root, 0, 1e9, c[i], rc + d[i]);
    }

    cout << (ans >= inf ? -1 : ans);
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int test = 1;
    //cin >> test;
    for (int i = 1; i <= test; i++)
        solveTestCase(i);
}

Compilation message (stderr)

pinball.cpp: In function 'long long int solveTestCase(long long int)':
pinball.cpp:67:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

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