oj.uz

답안 #152786

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152786 2019-09-09T13:43:20 Z dolphingarlic Pinball (JOI14_pinball) C++14
100 / 100
 984 ms 43912 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

struct Barrier {
    int a, b, c, d;
} brs[100000];
set<int> xs;
unordered_map<int, int> compressed;
ll segtree[8080808], dp1[100000], dp2[100000];
int m, n;

void update(int pos, ll val, int node = 1, int l = 1, int r = xs.size()) {
    if (l == r) segtree[node] = min(segtree[node], val);
    else {
        int mid = (l + r) / 2;
        if (pos > mid) update(pos, val, node * 2 + 1, mid + 1, r);
        else update(pos, val, node * 2, l, mid);
        segtree[node] = min(segtree[node * 2], segtree[node * 2 + 1]);
    }
}
ll query(int x, int y, int node = 1, int l = 1, int r = xs.size()) {
    if (x > r || y < l) return LLONG_MAX / m;
    else if (x <= l && y >= r) return segtree[node];
    else {
        int mid = (l + r) / 2;
        return min(query(x, y, node * 2, l, mid), query(x, y, node * 2 + 1, mid + 1, r));
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> m >> n;
    xs.insert(1);
    xs.insert(n);
    FOR(i, 0, m) {
        cin >> brs[i].a >> brs[i].b >> brs[i].c >> brs[i].d;
        xs.insert(brs[i].a); xs.insert(brs[i].b); xs.insert(brs[i].c);
    }
    int indx = 1;
    for (int i : xs) {
        compressed[i] = indx++;
    }

    fill(segtree, segtree + 4 * xs.size(), LLONG_MAX / m);
    update(1, 0);
    FOR(i, 0, m) {
        dp1[i] = query(compressed[brs[i].a], compressed[brs[i].b]) + brs[i].d;
        update(compressed[brs[i].c], dp1[i]);
    }

    fill(segtree, segtree + 4 * xs.size(), LLONG_MAX / m);
    update(xs.size(), 0);
    FOR(i, 0, m) {
        dp2[i] = query(compressed[brs[i].a], compressed[brs[i].b]) + brs[i].d;
        update(compressed[brs[i].c], dp2[i]);
    }

    ll ans = LLONG_MAX;
    FOR(i, 0, m) ans = min(ans, dp1[i] + dp2[i] - brs[i].d);
    if (ans < LLONG_MAX / m) cout << ans;
    else cout << -1;
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 5 ms 632 KB Output is correct
18 Correct 3 ms 380 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 4 ms 632 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 5 ms 760 KB Output is correct
24 Correct 5 ms 760 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 5 ms 632 KB Output is correct
18 Correct 3 ms 380 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 4 ms 632 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 5 ms 760 KB Output is correct
24 Correct 5 ms 760 KB Output is correct
25 Correct 38 ms 2808 KB Output is correct
26 Correct 137 ms 8108 KB Output is correct
27 Correct 384 ms 14488 KB Output is correct
28 Correct 198 ms 3716 KB Output is correct
29 Correct 294 ms 12728 KB Output is correct
30 Correct 310 ms 5624 KB Output is correct
31 Correct 710 ms 23592 KB Output is correct
32 Correct 580 ms 18488 KB Output is correct
33 Correct 83 ms 8328 KB Output is correct
34 Correct 356 ms 20224 KB Output is correct
35 Correct 575 ms 39888 KB Output is correct
36 Correct 984 ms 40036 KB Output is correct
37 Correct 793 ms 43912 KB Output is correct
38 Correct 770 ms 43688 KB Output is correct