oj.uz

Submission #846275

# Submission time Handle Problem Language Result Execution time Memory
846275 2023-09-07T13:09:42 Z Mohmad_Zaid Overtaking (IOI23_overtaking) C++17
39 / 100
 3500 ms 32200 KB 
#include "overtaking.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int l,x,n,m;
vector<vector<ll>>t,e;
vector<int>w,s;
struct segtree{
    int size=1;
    vector<ll>maxs;
    void init(int n){
        while(size<n)size*=2;
        maxs.resize(2*size-1,-1);
    }
    void update(int i,ll v,int x,int lx,int rx){
        if(rx-lx==1){
            maxs[x]=v;
            return;
        }
        int mid=(lx+rx)/2;
        if(i<mid)update(i,v,2*x+1,lx,mid);
        else update(i,v,2*x+2,mid,rx);
        maxs[x]=max(maxs[2*x+1],maxs[2*x+2]);
    }
    void update(int i,ll v){
        update(i,v,0,0,size);
    }
    void get(int l,int r,int x,int lx,int rx,ll& ans){
        if(lx>=r || rx<=l)return;
        if(lx>=l && rx<=r){
            ans=max(ans,maxs[x]);
            return;
        }
        int mid=(lx+rx)/2;
        get(l,r,2*x+1,lx,mid,ans);
        get(l,r,2*x+2,mid,rx,ans);
    }
    void get(int l,int r,ll& ans){
        get(l,r,0,0,size,ans);
    }
    void print(){
        for(int i=0;i<2*size-1;i++){
            if(maxs[i]>-1)cout<<maxs[i]<<' ';
        }
        cout<<endl;
    }
};
void init(int L, int N, vector<long long> T, vector<int> W, int X, int M, vector<int> S)
{
    l=L,x=X,n=N,m=M;
    w=W,s=S;
    t.resize(n+1,vector<ll>(m));
    e.resize(n+1,vector<ll>(m));
    for(int i=0;i<n;i++){
        t[i][0]=T[i];
    }
    segtree st;
    st.init(n);
    for(int stop=1;stop<m;stop++){
        vector<pair<ll,int>>bef;
        for(int i=0;i<n;i++){
            e[i][stop]=t[i][stop-1]+((W[i]*1LL)*(S[stop]-S[stop-1]));
            bef.pb({t[i][stop-1],i});
        }
        sort(bef.begin(),bef.end());
        for(int i=0;i<n;i++){
            st.update(i,e[bef[i].second][stop]);
        }
        for(int i=0;i<n;i++){
            int l=-1,r=n;
            while(l+1<r){
                int mid=(l+r)/2;
                if(bef[mid].first<t[i][stop-1])l=mid;
                else r=mid;
            }
            ll ans=e[i][stop];
            st.get(0,r,ans);
            t[i][stop]=ans;
        }
    }
    return;
}

long long arrival_time(long long Y){
    vector<vector<ll>>T(n+1,vector<ll>(m)),E(n+1,vector<ll>(m));
    T=t,E=e;
    T[n][0]=Y;
    segtree st2;
    st2.init(n+1);
    for(int stop=1;stop<m;stop++){
        E[n][stop]=T[n][stop-1]+((x*1LL)*(s[stop]-s[stop-1]));
        vector<pair<ll,int>>bef;
        for(int i=0;i<=n;i++){
            bef.pb({T[i][stop-1],i});
        }
        sort(bef.begin(),bef.end());
        bool ok=0;
        for(int i=0;i<=n;i++){
            st2.update(i,E[bef[i].second][stop]);
            if(ok){
                for(int j=i;j<=n;j++){
                    int te=bef[j].second;
                    if(T[n][stop-1]<T[te][stop-1]){
                        // E[te][stop]=T[te][stop-1]+((w[te]*1LL)*(s[stop]-s[stop-1]));
                        T[te][stop]=max(T[te][stop],E[n][stop]);
                    }
                }
                break;
            }
            if(bef[i].second!=n)continue;
            ok=1;
            int l=-1,r=i+1;
            while(l+1<r){
                int mid=(l+r)/2;
                if(bef[mid].first<T[n][stop-1])l=mid;
                else r=mid;
            }
            ll ans=E[n][stop];
            st2.get(0,r,ans);
            T[n][stop]=ans;
        }
    }
    // cout<<"E: "<<endl;
    // for(int stop=1;stop<m;stop++){
    //     for(int i=0;i<=n;i++){
    //         cout<<E[i][stop]<<' ';
    //     }cout<<endl;
    // }
    // cout<<endl<<"T: "<<endl;
    // for(int stop=1;stop<m;stop++){
    //     for(int i=0;i<=n;i++){
    //         cout<<T[i][stop]<<' ';
    //     }cout<<endl;
    // }
    return T[n][m-1];
}
// int main(){
//     int n,l,x,m;
//     cin>>l>>n>>x>>m;
//     vector<int>s(m+1),w(n+1);
//     vector<ll>t(n+1);
//     for(int i=0;i<n;i++)cin>>t[i];
//     for(int i=0;i<n;i++)cin>>w[i];
//     for(int i=0;i<m;i++)cin>>s[i];
//     init(l,n,t,w,x,m,s);
//     cout<<arrival_time(50)<<endl;
//     return 0;
// }

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 10 ms 348 KB Output is correct
6 Correct 39 ms 348 KB Output is correct
7 Correct 55 ms 492 KB Output is correct
8 Correct 67 ms 512 KB Output is correct
9 Correct 67 ms 348 KB Output is correct
10 Correct 67 ms 348 KB Output is correct
11 Correct 80 ms 512 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 13 ms 348 KB Output is correct
5 Correct 54 ms 540 KB Output is correct
6 Correct 113 ms 656 KB Output is correct
7 Correct 147 ms 716 KB Output is correct
8 Correct 160 ms 716 KB Output is correct
9 Correct 141 ms 708 KB Output is correct
10 Correct 145 ms 704 KB Output is correct
11 Correct 152 ms 604 KB Output is correct
12 Correct 151 ms 700 KB Output is correct
13 Correct 154 ms 704 KB Output is correct
14 Correct 150 ms 604 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 33 ms 1024 KB Output is correct
10 Correct 31 ms 604 KB Output is correct
11 Correct 33 ms 604 KB Output is correct
12 Correct 33 ms 748 KB Output is correct
13 Correct 34 ms 600 KB Output is correct
14 Correct 30 ms 780 KB Output is correct
15 Correct 34 ms 908 KB Output is correct
16 Correct 36 ms 604 KB Output is correct
17 Correct 35 ms 604 KB Output is correct
18 Correct 46 ms 604 KB Output is correct
19 Correct 33 ms 600 KB Output is correct
20 Correct 33 ms 604 KB Output is correct
21 Correct 18 ms 348 KB Output is correct
22 Correct 24 ms 604 KB Output is correct
23 Correct 41 ms 604 KB Output is correct
24 Correct 37 ms 704 KB Output is correct
25 Correct 33 ms 604 KB Output is correct
26 Correct 35 ms 688 KB Output is correct
27 Correct 32 ms 604 KB Output is correct
28 Correct 26 ms 604 KB Output is correct
29 Correct 30 ms 604 KB Output is correct
30 Correct 27 ms 640 KB Output is correct
31 Correct 31 ms 620 KB Output is correct
32 Correct 36 ms 604 KB Output is correct
33 Correct 38 ms 604 KB Output is correct
34 Correct 35 ms 604 KB Output is correct
35 Correct 36 ms 772 KB Output is correct
36 Correct 35 ms 604 KB Output is correct
37 Correct 36 ms 752 KB Output is correct
38 Correct 61 ms 604 KB Output is correct
39 Correct 49 ms 768 KB Output is correct
40 Correct 33 ms 776 KB Output is correct

Subtask #4
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 10 ms 348 KB Output is correct
7 Correct 39 ms 348 KB Output is correct
8 Correct 55 ms 492 KB Output is correct
9 Correct 67 ms 512 KB Output is correct
10 Correct 67 ms 348 KB Output is correct
11 Correct 67 ms 348 KB Output is correct
12 Correct 80 ms 512 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 33 ms 1024 KB Output is correct
17 Correct 31 ms 604 KB Output is correct
18 Correct 33 ms 604 KB Output is correct
19 Correct 33 ms 748 KB Output is correct
20 Correct 34 ms 600 KB Output is correct
21 Correct 30 ms 780 KB Output is correct
22 Correct 34 ms 908 KB Output is correct
23 Correct 36 ms 604 KB Output is correct
24 Correct 35 ms 604 KB Output is correct
25 Correct 46 ms 604 KB Output is correct
26 Correct 33 ms 600 KB Output is correct
27 Correct 33 ms 604 KB Output is correct
28 Correct 18 ms 348 KB Output is correct
29 Correct 24 ms 604 KB Output is correct
30 Correct 41 ms 604 KB Output is correct
31 Correct 37 ms 704 KB Output is correct
32 Correct 33 ms 604 KB Output is correct
33 Correct 35 ms 688 KB Output is correct
34 Correct 32 ms 604 KB Output is correct
35 Correct 26 ms 604 KB Output is correct
36 Correct 30 ms 604 KB Output is correct
37 Correct 27 ms 640 KB Output is correct
38 Correct 31 ms 620 KB Output is correct
39 Correct 36 ms 604 KB Output is correct
40 Correct 38 ms 604 KB Output is correct
41 Correct 35 ms 604 KB Output is correct
42 Correct 36 ms 772 KB Output is correct
43 Correct 35 ms 604 KB Output is correct
44 Correct 36 ms 752 KB Output is correct
45 Correct 61 ms 604 KB Output is correct
46 Correct 49 ms 768 KB Output is correct
47 Correct 33 ms 776 KB Output is correct
48 Execution timed out 3528 ms 32200 KB Time limit exceeded
49 Halted 0 ms 0 KB -

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 10 ms 348 KB Output is correct
7 Correct 39 ms 348 KB Output is correct
8 Correct 55 ms 492 KB Output is correct
9 Correct 67 ms 512 KB Output is correct
10 Correct 67 ms 348 KB Output is correct
11 Correct 67 ms 348 KB Output is correct
12 Correct 80 ms 512 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 13 ms 348 KB Output is correct
17 Correct 54 ms 540 KB Output is correct
18 Correct 113 ms 656 KB Output is correct
19 Correct 147 ms 716 KB Output is correct
20 Correct 160 ms 716 KB Output is correct
21 Correct 141 ms 708 KB Output is correct
22 Correct 145 ms 704 KB Output is correct
23 Correct 152 ms 604 KB Output is correct
24 Correct 151 ms 700 KB Output is correct
25 Correct 154 ms 704 KB Output is correct
26 Correct 150 ms 604 KB Output is correct
27 Correct 33 ms 1024 KB Output is correct
28 Correct 31 ms 604 KB Output is correct
29 Correct 33 ms 604 KB Output is correct
30 Correct 33 ms 748 KB Output is correct
31 Correct 34 ms 600 KB Output is correct
32 Correct 30 ms 780 KB Output is correct
33 Correct 34 ms 908 KB Output is correct
34 Correct 36 ms 604 KB Output is correct
35 Correct 35 ms 604 KB Output is correct
36 Correct 46 ms 604 KB Output is correct
37 Correct 33 ms 600 KB Output is correct
38 Correct 33 ms 604 KB Output is correct
39 Correct 18 ms 348 KB Output is correct
40 Correct 24 ms 604 KB Output is correct
41 Correct 41 ms 604 KB Output is correct
42 Correct 37 ms 704 KB Output is correct
43 Correct 33 ms 604 KB Output is correct
44 Correct 35 ms 688 KB Output is correct
45 Correct 32 ms 604 KB Output is correct
46 Correct 26 ms 604 KB Output is correct
47 Correct 30 ms 604 KB Output is correct
48 Correct 27 ms 640 KB Output is correct
49 Correct 31 ms 620 KB Output is correct
50 Correct 36 ms 604 KB Output is correct
51 Correct 38 ms 604 KB Output is correct
52 Correct 35 ms 604 KB Output is correct
53 Correct 36 ms 772 KB Output is correct
54 Correct 35 ms 604 KB Output is correct
55 Correct 36 ms 752 KB Output is correct
56 Correct 61 ms 604 KB Output is correct
57 Correct 49 ms 768 KB Output is correct
58 Correct 33 ms 776 KB Output is correct
59 Execution timed out 3528 ms 32200 KB Time limit exceeded
60 Halted 0 ms 0 KB -