oj.uz

Submission #882312

# Submission time Handle Problem Language Result Execution time Memory
882312 2023-12-03T03:46:28 Z noompty Pinball (JOI14_pinball) C++17
100 / 100
 674 ms 93448 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <array>
#include <random>
#include <string>
#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 val) {
    if (pos < x->l || x->r <= pos) {
        return;
    }
    if (x->l + 1 == x->r) {
        x->mn = min(x->mn, val);
        return;
    }
    update(x->lft, pos, val);
    update(x->rht, pos, val);
    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));
}

int n, m, idx;
ll ans;
set<int> coords;
map<int, int> mp;
vector<array<int, 4>> otiles, tiles;
Node *rootl, *rootr;

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;
        coords.insert(a);
        coords.insert(b);
        coords.insert(c);
        otiles.push_back({a, b, c, d});
    }
    coords.insert(1);
    coords.insert(n);

    for (int i : coords) {
        mp[i] = idx++;
    }

    rootl = new Node(0, idx);
    rootr = new Node(0, idx);
    for (int i = 0; i < m; i++) {
        tiles.push_back({mp[otiles[i][0]], mp[otiles[i][1]], mp[otiles[i][2]], otiles[i][3]});
    }

    ans = 1e18;
    for (int i = 0; i < m; i++) {
        ll lft = (!tiles[i][0] ? 0 : query(rootl, tiles[i][0], tiles[i][1] + 1)) + tiles[i][3];
        ll rht = (tiles[i][1] == idx - 1 ? 0 : query(rootr, tiles[i][0], tiles[i][1] + 1)) + tiles[i][3];
        update(rootl, tiles[i][2], lft);
        update(rootr, tiles[i][2], rht);
        ans = min(ans, lft + rht - tiles[i][3]);
    }

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

}

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 784 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 528 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 784 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 528 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 3 ms 1368 KB Output is correct
23 Correct 2 ms 1388 KB Output is correct
24 Correct 3 ms 1372 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 784 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 528 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 464 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 3 ms 1368 KB Output is correct
23 Correct 2 ms 1388 KB Output is correct
24 Correct 3 ms 1372 KB Output is correct
25 Correct 24 ms 6100 KB Output is correct
26 Correct 85 ms 18124 KB Output is correct
27 Correct 295 ms 35676 KB Output is correct
28 Correct 118 ms 9160 KB Output is correct
29 Correct 183 ms 30408 KB Output is correct
30 Correct 201 ms 14016 KB Output is correct
31 Correct 526 ms 56132 KB Output is correct
32 Correct 427 ms 42940 KB Output is correct
33 Correct 54 ms 18572 KB Output is correct
34 Correct 251 ms 46784 KB Output is correct
35 Correct 344 ms 93124 KB Output is correct
36 Correct 674 ms 93448 KB Output is correct
37 Correct 554 ms 93412 KB Output is correct
38 Correct 488 ms 93212 KB Output is correct