oj.uz

Submission #896510

# Submission time Handle Problem Language Result Execution time Memory
896510 2024-01-01T15:10:14 Z Aiperiii Pinball (JOI14_pinball) C++14
51 / 100
 276 ms 59556 KB 
#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
const int N=1e5+5;
int l[N*4],r[N*4];
map <int,int> val_ind;
void build(int v,int tl,int tr){
    if(tl==tr){
        l[v]=1e16;
        r[v]=1e16;
    }
    else{
        int tm=(tl+tr)/2;
        build(v*2,tl,tm);
        build(v*2+1,tm+1,tr);
        l[v]=min(l[v*2],l[v*2+1]);
        r[v]=min(r[v*2],r[v*2+1]);
    }
}
int get_min_l(int v,int tl,int tr,int L,int R){
    if(tr<L or R<tl)return 1e18;
    if(L<=tl && tr<=R)return l[v];
    int tm=(tl+tr)/2;
    return min(get_min_l(v*2,tl,tm,L,R), get_min_l(v*2+1,tm+1,tr,L,R));
}
int get_min_r(int v,int tl,int tr,int L,int R){
    if(tr<L or R<tl)return 1e18;
    if(L<=tl && tr<=R)return r[v];
    int tm=(tl+tr)/2;
    return min(get_min_r(v*2,tl,tm,L,R), get_min_r(v*2+1,tm+1,tr,L,R));
}
void update_l(int v,int tl,int tr,int pos,int val){
    if(tl==tr)l[v]=min(val,l[v]);
    else{
        int tm=(tl+tr)/2;
        if(pos<=tm)update_l(v*2,tl,tm,pos,val);
        else update_l(v*2+1,tm+1,tr,pos,val);
        l[v]=min(l[v*2],l[v*2+1]);
    }
}
void update_r(int v,int tl,int tr,int pos,int val){
    if(tl==tr)r[v]=min(val,r[v]);
    else{
        int tm=(tl+tr)/2;
        if(pos<=tm)update_r(v*2,tl,tm,pos,val);
        else update_r(v*2+1,tm+1,tr,pos,val);
        r[v]=min(r[v*2],r[v*2+1]);
    }
}
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);
    int m,T;
    cin>>m>>T;
    vector <int> a(m),b(m),c(m),d(m);
    set <int> st;
    st.insert(1);st.insert(T);
    for(int i=0;i<m;i++){
        cin>>a[i]>>b[i]>>c[i]>>d[i];
        st.insert(a[i]);
        st.insert(b[i]);
        st.insert(c[i]);
    }
    int cnt=1;
    for(auto x : st){
        val_ind[x]=cnt;
        cnt++;
    }
    
    int n=st.size();
    build(1,1,n);
    
    int ans=1e16;
    for(int i=0;i<m;i++){
        int res=0;
        if(a[i]==1){
            res+=d[i];
            update_l(1,1,n,val_ind[c[i]],d[i]);
        }
        else{
            int x=get_min_l(1,1,n,val_ind[a[i]],val_ind[b[i]]);
            res+=x;res+=d[i];
            update_l(1,1,n,val_ind[c[i]],x+d[i]);
        }
        if(b[i]==T){
            res+=d[i];
            update_r(1,1,n,val_ind[c[i]],d[i]);
        }
        else{
            int x=get_min_r(1,1,n,val_ind[a[i]],val_ind[b[i]]);
            res+=x;res+=d[i];
            update_r(1,1,n,val_ind[c[i]],x+d[i]);
        }
        ans=min(ans,res-d[i]);
    }
    if(ans==1e16)ans=-1;
    cout<<ans<<"\n";
}

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 3 ms 2908 KB Output is correct
20 Correct 3 ms 2596 KB Output is correct
21 Correct 2 ms 2648 KB Output is correct
22 Correct 3 ms 2908 KB Output is correct
23 Correct 4 ms 2908 KB Output is correct
24 Correct 3 ms 2908 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 3 ms 2908 KB Output is correct
20 Correct 3 ms 2596 KB Output is correct
21 Correct 2 ms 2648 KB Output is correct
22 Correct 3 ms 2908 KB Output is correct
23 Correct 4 ms 2908 KB Output is correct
24 Correct 3 ms 2908 KB Output is correct
25 Correct 30 ms 7004 KB Output is correct
26 Correct 92 ms 12468 KB Output is correct
27 Correct 275 ms 21448 KB Output is correct
28 Correct 197 ms 9644 KB Output is correct
29 Correct 196 ms 19116 KB Output is correct
30 Correct 276 ms 13648 KB Output is correct
31 Runtime error 234 ms 59556 KB Execution killed with signal 11
32 Halted 0 ms 0 KB -