oj.uz

답안 #117618

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
117618 2019-06-16T19:19:12 Z evpipis Pinball (JOI14_pinball) C++17
100 / 100
 669 ms 151188 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int len = 1e5+5;
const ll inf = 1e18;
int lef[len], rig[len], pos[len], cost[len];
ll dp[len][3];

struct node{
    ll mn0, mn1;
    node *left, *right;

    node(ll m0 = inf, ll m1 = inf, node *l = NULL, node *r = NULL){
        mn0 = m0;
        mn1 = m1;
        left = l;
        right = r;
    }
};

typedef node* pnode;
pnode null = new node(), root = new node();

pnode upd(pnode t, int l, int r, int i, ll m0, ll m1){
    if (l == r)
        return new node(min(t->mn0, m0), min(t->mn1, m1), null, null);

    int mid = (l+r)/2;
    if (i <= mid)
        return new node(min(t->mn0, m0), min(t->mn1, m1), upd(t->left, l, mid, i, m0, m1), t->right);
    return new node(min(t->mn0, m0), min(t->mn1, m1), t->left, upd(t->right, mid+1, r, i, m0, m1));
}

node join(node a, node b){
    node c;
    c.mn0 = min(a.mn0, b.mn0);
    c.mn1 = min(a.mn1, b.mn1);
    return c;
}

node ask(pnode t, int l, int r, int i, int j){
    if (r < i || j < l)
        return node();
    if (i <= l && r <= j)
        return *t;

    int mid = (l+r)/2;
    return join(ask(t->left, l, mid, i, j), ask(t->right, mid+1, r, i, j));
}

int main(){
    int n, m;
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++)
        scanf("%d %d %d %d", &lef[i], &rig[i], &pos[i], &cost[i]);

    null->left = null->right = root = null;
    ll ans = inf;
    for (int i = 1; i <= n; i++){
        ll d0 = ask(root, 1, m, lef[i], rig[i]).mn0+cost[i];
        ll d1 = ask(root, 1, m, lef[i], rig[i]).mn1+cost[i];

        if (lef[i] == 1 && rig[i] == m)
            d0 = d1 = cost[i];
        else if (lef[i] == 1)
            d0 = cost[i];
        else if (rig[i] == m)
            d1 = cost[i];

        ans = min(ans, d0+d1-cost[i]);
        root = upd(root, 1, m, pos[i], d0, d1);
        //printf("i = %d, d0 = %lld, d1 = %lld, d2 = %lld\n", i, d0, d1, d0+d1-cost[i]);
    }

    if (ans == inf)
        printf("-1\n");
    else
        printf("%lld", ans);
    return 0;
}

Compilation message

pinball.cpp: In function 'int main()':
pinball.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
pinball.cpp:56:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d %d", &lef[i], &rig[i], &pos[i], &cost[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 3 ms 640 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 640 KB Output is correct
17 Correct 7 ms 1792 KB Output is correct
18 Correct 6 ms 1820 KB Output is correct
19 Correct 6 ms 1792 KB Output is correct
20 Correct 7 ms 1920 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 6 ms 1792 KB Output is correct
23 Correct 6 ms 1920 KB Output is correct
24 Correct 6 ms 1792 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 3 ms 640 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 640 KB Output is correct
17 Correct 7 ms 1792 KB Output is correct
18 Correct 6 ms 1820 KB Output is correct
19 Correct 6 ms 1792 KB Output is correct
20 Correct 7 ms 1920 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 6 ms 1792 KB Output is correct
23 Correct 6 ms 1920 KB Output is correct
24 Correct 6 ms 1792 KB Output is correct
25 Correct 38 ms 10668 KB Output is correct
26 Correct 116 ms 32220 KB Output is correct
27 Correct 407 ms 94760 KB Output is correct
28 Correct 452 ms 142844 KB Output is correct
29 Correct 291 ms 73328 KB Output is correct
30 Correct 669 ms 151028 KB Output is correct
31 Correct 647 ms 151188 KB Output is correct
32 Correct 646 ms 151132 KB Output is correct
33 Correct 70 ms 24120 KB Output is correct
34 Correct 263 ms 73388 KB Output is correct
35 Correct 413 ms 151052 KB Output is correct
36 Correct 612 ms 150996 KB Output is correct
37 Correct 521 ms 151032 KB Output is correct
38 Correct 523 ms 151080 KB Output is correct