oj.uz

답안 #594447

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
594447 2022-07-12T13:07:54 Z Vanilla Pinball (JOI14_pinball) C++17
51 / 100
 1000 ms 304816 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) {};
    
    void extend() {
        if (left != NULL) return;
        int mid = (l + r) / 2;
        left = new node(l, mid, 1e15);
        right = new node(mid + 1, r, 1e15);
    }

    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));
    }

    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;
        rs = min(rs, lf->query(a, b) + rt->query(a, b) + cost);
        lf->update(c, lf->query(a, b) + cost);
        rt->update(c, rt->query(a, b) + cost);
    }
    cout << (rs >= 1e15 ? -1: rs);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 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 2220 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 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 0 ms 212 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 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 2220 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 1 ms 424 KB Output is correct
16 Correct 3 ms 1492 KB Output is correct
17 Correct 10 ms 3748 KB Output is correct
18 Correct 4 ms 440 KB Output is correct
19 Correct 12 ms 8532 KB Output is correct
20 Correct 7 ms 2644 KB Output is correct
21 Correct 4 ms 2616 KB Output is correct
22 Correct 12 ms 8508 KB Output is correct
23 Correct 13 ms 9784 KB Output is correct
24 Correct 13 ms 9908 KB Output is correct

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 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 2220 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 ms 2516 KB Output is correct
15 Correct 1 ms 424 KB Output is correct
16 Correct 3 ms 1492 KB Output is correct
17 Correct 10 ms 3748 KB Output is correct
18 Correct 4 ms 440 KB Output is correct
19 Correct 12 ms 8532 KB Output is correct
20 Correct 7 ms 2644 KB Output is correct
21 Correct 4 ms 2616 KB Output is correct
22 Correct 12 ms 8508 KB Output is correct
23 Correct 13 ms 9784 KB Output is correct
24 Correct 13 ms 9908 KB Output is correct
25 Correct 53 ms 15196 KB Output is correct
26 Correct 224 ms 82372 KB Output is correct
27 Correct 599 ms 141064 KB Output is correct
28 Correct 410 ms 6528 KB Output is correct
29 Correct 516 ms 168576 KB Output is correct
30 Correct 658 ms 33180 KB Output is correct
31 Execution timed out 1061 ms 304816 KB Time limit exceeded
32 Halted 0 ms 0 KB -