oj.uz

Submission #869874

# Submission time Handle Problem Language Result Execution time Memory
869874 2023-11-06T03:38:12 Z 12345678 Pinball (JOI14_pinball) C++17
100 / 100
 418 ms 177260 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=1e5+5, inf=1e9;
ll dpl[nx], dpr[nx], n, m, a[nx], b[nx], c[nx], d[nx], ml, mr, res=1e17;

struct segtree
{
    struct node
    {
        ll val;
        node *l, *r;
        node(): val(1e17), l(0), r(0){}
    };
    typedef node* pnode;
    pnode rt=0;
    void update(int l, int r, pnode &i, int idx, ll val)
    {
        if (!i) i=new node();
        if (r<idx||idx<l) return;
        if (l==r) return void(i->val=min(val, i->val));
        int md=(l+r)/2;
        update(l, md, i->l, idx, val);
        update(md+1, r, i->r, idx, val);
        i->val=min(i->l->val, i->r->val);
    }
    ll query(int l, int r, pnode i, int ql, int qr)
    {
        if (qr<l||r<ql||!i) return 1e17;
        if (ql<=l&&r<=qr) return i->val;
        int md=(l+r)/2;
        return min(query(l, md, i->l, ql, qr), query(md+1, r, i->r, ql, qr));
    }
} sl, sr;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>m>>n;
    for (int i=1; i<=m; i++) cin>>a[i]>>b[i]>>c[i]>>d[i];
    for (int i=1; i<=m; i++)
    {
        dpl[i]=dpr[i]=ml=mr=1e17;
        if (a[i]==1) dpl[i]=d[i], ml=0;
        if (b[i]==n) dpr[i]=d[i], mr=0;
        ll resl=sl.query(1, n, sl.rt, a[i], b[i]);
        ll resr=sr.query(1, n, sr.rt, a[i], b[i]);
        dpl[i]=min(dpl[i], resl+d[i]);
        dpr[i]=min(dpr[i], resr+d[i]);
        sl.update(1, n, sl.rt, c[i], dpl[i]);
        sr.update(1, n, sr.rt, c[i], dpr[i]);
        ml=min(ml, resl);
        mr=min(mr, resr);
        res=min(res, ml+mr+d[i]);
        //cout<<i<<' '<<dpl[i]<<' '<<dpr[i]<<' '<<ml<<' '<<mr<<' '<<res<<'\n';
    }
    cout<<((res==1e17)?-1:res);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4440 KB Output is correct
10 Correct 1 ms 4848 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4996 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4440 KB Output is correct
10 Correct 1 ms 4848 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4996 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 3 ms 5980 KB Output is correct
18 Correct 2 ms 4568 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 3 ms 5724 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 4 ms 7024 KB Output is correct
24 Correct 4 ms 7004 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4440 KB Output is correct
10 Correct 1 ms 4848 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4996 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 3 ms 5980 KB Output is correct
18 Correct 2 ms 4568 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 3 ms 5724 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 4 ms 6492 KB Output is correct
23 Correct 4 ms 7024 KB Output is correct
24 Correct 4 ms 7004 KB Output is correct
25 Correct 19 ms 10844 KB Output is correct
26 Correct 70 ms 33580 KB Output is correct
27 Correct 244 ms 69460 KB Output is correct
28 Correct 162 ms 10772 KB Output is correct
29 Correct 173 ms 70228 KB Output is correct
30 Correct 233 ms 27912 KB Output is correct
31 Correct 418 ms 130548 KB Output is correct
32 Correct 383 ms 106960 KB Output is correct
33 Correct 43 ms 27732 KB Output is correct
34 Correct 177 ms 87636 KB Output is correct
35 Correct 280 ms 177260 KB Output is correct
36 Correct 410 ms 171664 KB Output is correct
37 Correct 359 ms 171860 KB Output is correct
38 Correct 364 ms 171980 KB Output is correct