oj.uz

답안 #778046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778046 2023-07-10T04:51:38 Z horiiseun Pinball (JOI14_pinball) C++17
51 / 100
 815 ms 524288 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), lft(NULL), rht(NULL) {}
};

void create(Node *x) {
    if (!x->lft) {
        x->lft = new Node(x->l, (x->l + x->r) / 2);
    }
    if (!x->rht) {
        x->rht = new Node((x->l + x->r) / 2, x->r);
    }
}

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;
    }
    create(x);
    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;
    }
    create(x);
    return min(query(x->lft, l, r), query(x->rht, l, r));
}

Node *rl, *rr;
int m, n;
ll lc, rc, ans;

int main() {

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

    cin >> m >> n;
    rl = new Node(0, n + 1);
    rr = new Node(0, n + 1);

    ans = 1e18;
    for (int i = 0, a, b, c, d; i < m; i++) {
        cin >> a >> b >> c >> d;
        lc = (a == 1 ? 0 : query(rl, a, b + 1)) + d;
        rc = (b == n ? 0 : query(rr, a, b + 1)) + 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 220 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 220 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 852 KB Output is correct
12 Correct 2 ms 2132 KB Output is correct
13 Correct 4 ms 2264 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 220 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 852 KB Output is correct
12 Correct 2 ms 2132 KB Output is correct
13 Correct 4 ms 2264 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 1492 KB Output is correct
17 Correct 5 ms 3788 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 9 ms 8524 KB Output is correct
20 Correct 5 ms 2632 KB Output is correct
21 Correct 3 ms 2516 KB Output is correct
22 Correct 8 ms 8520 KB Output is correct
23 Correct 11 ms 9852 KB Output is correct
24 Correct 9 ms 9848 KB Output is correct

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 220 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 852 KB Output is correct
12 Correct 2 ms 2132 KB Output is correct
13 Correct 4 ms 2264 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 1492 KB Output is correct
17 Correct 5 ms 3788 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 9 ms 8524 KB Output is correct
20 Correct 5 ms 2632 KB Output is correct
21 Correct 3 ms 2516 KB Output is correct
22 Correct 8 ms 8520 KB Output is correct
23 Correct 11 ms 9852 KB Output is correct
24 Correct 9 ms 9848 KB Output is correct
25 Correct 31 ms 15188 KB Output is correct
26 Correct 153 ms 82492 KB Output is correct
27 Correct 446 ms 141264 KB Output is correct
28 Correct 229 ms 6544 KB Output is correct
29 Correct 369 ms 168392 KB Output is correct
30 Correct 450 ms 33232 KB Output is correct
31 Correct 815 ms 304756 KB Output is correct
32 Correct 672 ms 206028 KB Output is correct
33 Correct 88 ms 70580 KB Output is correct
34 Correct 434 ms 296392 KB Output is correct
35 Runtime error 573 ms 524288 KB Execution killed with signal 9
36 Halted 0 ms 0 KB -