oj.uz

답안 #594450

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
594450 2022-07-12T13:12:45 Z Vanilla Pinball (JOI14_pinball) C++17
51 / 100
 947 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
const int maxn = 1e5 + 2;
int n,m;

struct node {
    int l,r;
    int64 v;

    node* left;
    node* right;

    node(int _l, int _r, int64 _v): l(_l), r(_r), v(_v) {};
    
    inline void extend() {
        if (left != NULL) return;
        int mid = (l + r) / 2;
        left = new node(l, mid, 1e15);
        right = new node(mid + 1, r, 1e15);
    }

    inline int64 query (int il, int ir) {
        if (il <= l && r <= ir) return v;
        if (l > ir || r < il) return 1e15;
        extend();
        return min(left->query(il, ir), right->query(il, ir));
    }

    inline void update (int x, int64 nval) {
        if (l == r && l == x) return void(v = min(v, nval));
        if (l > x || r < x) return;
        extend();
        left->update(x, nval);
        right->update(x, nval);
        v = min(left->v, right->v);
    }
};
 
 
int main() {
    cin >> n >> m;
    node* lf = new node(0, m + 1, 1e15);
    node* rt = new node(0, m + 1, 1e15);
    int64 rs = 1e15;
    lf->update(1, 0);
    rt->update(m, 0);
    for (int i = 0; i < n; i++){
        int64 a,b,c,cost;
        cin >> a >> b >> c >> cost;
        int64 p1 = lf->query(a,b);
        int64 p2 = rt->query(a,b);
        rs = min(rs, p1 + p2 + cost);
        lf->update(c, p1 + cost);
        rt->update(c, p2 + cost);
    }
    cout << (rs >= 1e15 ? -1: rs);
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 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 3 ms 2132 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 ms 2388 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 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 3 ms 2132 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 ms 2388 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 1492 KB Output is correct
17 Correct 7 ms 3796 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 12 ms 8556 KB Output is correct
20 Correct 6 ms 2644 KB Output is correct
21 Correct 3 ms 2516 KB Output is correct
22 Correct 12 ms 8500 KB Output is correct
23 Correct 11 ms 9684 KB Output is correct
24 Correct 14 ms 9920 KB Output is correct

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
8 Correct 0 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 3 ms 2132 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 ms 2388 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 1492 KB Output is correct
17 Correct 7 ms 3796 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 12 ms 8556 KB Output is correct
20 Correct 6 ms 2644 KB Output is correct
21 Correct 3 ms 2516 KB Output is correct
22 Correct 12 ms 8500 KB Output is correct
23 Correct 11 ms 9684 KB Output is correct
24 Correct 14 ms 9920 KB Output is correct
25 Correct 55 ms 14884 KB Output is correct
26 Correct 192 ms 81472 KB Output is correct
27 Correct 536 ms 138664 KB Output is correct
28 Correct 339 ms 2828 KB Output is correct
29 Correct 453 ms 166448 KB Output is correct
30 Correct 583 ms 29384 KB Output is correct
31 Correct 947 ms 301016 KB Output is correct
32 Correct 859 ms 206088 KB Output is correct
33 Correct 116 ms 70588 KB Output is correct
34 Correct 541 ms 296664 KB Output is correct
35 Runtime error 763 ms 524288 KB Execution killed with signal 9
36 Halted 0 ms 0 KB -