oj.uz

Submission #778054

# Submission time Handle Problem Language Result Execution time Memory
778054 2023-07-10T05:14:13 Z horiiseun Pinball (JOI14_pinball) C++17
100 / 100
 672 ms 91908 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
    #define D(...)
#endif

struct Node {
    int l, r;
    ll mn;
    Node *lft, *rht;
    Node (int tl, int tr): l(tl), r(tr), mn(1e18) {
        if (l + 1 != r) {
            lft = new Node(l, (l + r) / 2);
            rht = new Node((l + r) / 2, r);
        } else {
            lft = rht = NULL;
        }
    }
};

void update(Node *x, int pos, ll v) {
    if (pos < x->l || x->r <= pos) {
        return;
    }
    if (x->l + 1 == x->r) {
        x->mn = min(x->mn, v);
        return;
    }
    update(x->lft, pos, v);
    update(x->rht, pos, v);
    x->mn = min(x->lft->mn, x->rht->mn);
}

ll query(Node *x, int l, int r) {
    if (r <= x->l || x->r <= l) {
        return 1e18;
    }
    if (l <= x->l && x->r <= r) {
        return x->mn;
    }
    return min(query(x->lft, l, r), query(x->rht, l, r));
}

Node *rl, *rr;
int m, n, idx;
ll lc, rc, ans;
vector<tuple<int, int, int, int>> og, sm;
set<int> coords;
map<int, int> mp;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> m >> n;
    for (int i = 0, a, b, c, d; i < m; i++) {
        cin >> a >> b >> c >> d;
        og.push_back({a, b, c, d});
        coords.insert(a);
        coords.insert(b);
        coords.insert(c);
    }
    coords.insert(1);
    coords.insert(n);

    for (int i : coords) {
        mp.insert({i, idx++});
    }
    for (auto [a, b, c, d] : og) {
        sm.push_back({mp[a], mp[b], mp[c], d});
    }

    rl = new Node(0, idx + 5);
    rr = new Node(0, idx + 5);
    ans = 1e18;
    for (auto [a, b, c, d] : sm) {
        lc = (a == 0 ? 0 : query(rl, a, b + 1)) + (ll) d;
        rc = (b == idx - 1 ? 0 : query(rr, a, b + 1)) + (ll) d;
        update(rl, c, lc);
        update(rr, c, rc);
        ans = min(ans, lc + rc - (ll) d);
    }

    cout << (ans == 1e18 ? -1 : ans) << "\n";

}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 276 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 276 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 276 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 3 ms 980 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 3 ms 1108 KB Output is correct
23 Correct 2 ms 1108 KB Output is correct
24 Correct 4 ms 1120 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 276 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 3 ms 980 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 3 ms 1108 KB Output is correct
23 Correct 2 ms 1108 KB Output is correct
24 Correct 4 ms 1120 KB Output is correct
25 Correct 25 ms 5464 KB Output is correct
26 Correct 104 ms 16836 KB Output is correct
27 Correct 280 ms 31056 KB Output is correct
28 Correct 146 ms 5048 KB Output is correct
29 Correct 190 ms 27572 KB Output is correct
30 Correct 209 ms 8480 KB Output is correct
31 Correct 489 ms 50692 KB Output is correct
32 Correct 441 ms 37420 KB Output is correct
33 Correct 55 ms 17428 KB Output is correct
34 Correct 254 ms 44072 KB Output is correct
35 Correct 322 ms 91660 KB Output is correct
36 Correct 672 ms 91820 KB Output is correct
37 Correct 579 ms 91704 KB Output is correct
38 Correct 515 ms 91908 KB Output is correct