oj.uz

Submission #881929

# Submission time Handle Problem Language Result Execution time Memory
881929 2023-12-02T09:37:00 Z irmuun Overtaking (IOI23_overtaking) C++17
39 / 100
 3500 ms 600 KB 
#include<bits/stdc++.h>
#include "overtaking.h"
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int l,n,x,m;
vector<ll>t;
vector<int>w,s;

void init(int L,int N,vector<ll>T,vector<int>W,int X,int M,vector<int>S){
    l=L; n=N; t=T; w=W; x=X; m=M; s=S;
}

ll arrival_time(ll Y){
    if(n==1){
        ll e[2],nxt[2];
        e[0]=t[0];
        e[1]=Y;
        for(int i=1;i<m;i++){
            nxt[0]=e[0]+1ll*(s[i]-s[i-1])*w[0];
            nxt[1]=e[1]+1ll*(s[i]-s[i-1])*x;
            if(e[0]<e[1]){
                nxt[1]=max(nxt[1],nxt[0]);
            }
            if(e[0]>e[1]){
                nxt[0]=max(nxt[0],nxt[1]);
            }
            e[0]=nxt[0];
            e[1]=nxt[1];
        }
        return e[1];
    }
    if(m==2){
        ll ans=Y+1ll*l*x;
        for(int i=0;i<n;i++){
            if(t[i]<Y){
                ll exp=1ll*t[i]+1ll*l*w[i];
                ans=max(ans,exp);
            }
        }
        return ans;
    }
    vector<ll>e(n+1),nxt(n+1);
    vector<pair<ll,int>>vec;
    w.pb(x);
    t.pb(Y);
    for(int i=0;i<=n;i++){
        e[i]=t[i];
    }
    for(int j=1;j<m;j++){
        for(int i=0;i<=n;i++){
            nxt[i]=e[i]+1ll*(s[j]-s[j-1])*w[i];
        }
        vec.clear();
        for(int i=0;i<=n;i++){
            vec.pb({e[i],i});
        }
        sort(all(vec));
        int L=0;
        ll mx=0;
        for(int i=0;i<=n;i++){
            if(vec[i].ff==vec[0].ff){
                continue;
            }
            if(vec[i].ff!=vec[i-1].ff){
                for(int k=L;k<i;k++){
                    mx=max(mx,nxt[vec[k].ss]);
                }
                L=i;
            }
            nxt[vec[i].ss]=max(nxt[vec[i].ss],mx);
        }
        for(int i=0;i<=n;i++){
            e[i]=max(e[i],nxt[i]);
        }
    }
    w.pop_back();
    t.pop_back();
    return e[n];
}

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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 452 KB Output is correct
11 Correct 2 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 3 ms 472 KB Output is correct
14 Correct 3 ms 600 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 25 ms 600 KB Output is correct
10 Correct 24 ms 348 KB Output is correct
11 Correct 25 ms 600 KB Output is correct
12 Correct 25 ms 432 KB Output is correct
13 Correct 25 ms 344 KB Output is correct
14 Correct 23 ms 348 KB Output is correct
15 Correct 28 ms 348 KB Output is correct
16 Correct 26 ms 348 KB Output is correct
17 Correct 25 ms 348 KB Output is correct
18 Correct 25 ms 348 KB Output is correct
19 Correct 26 ms 440 KB Output is correct
20 Correct 25 ms 348 KB Output is correct
21 Correct 15 ms 348 KB Output is correct
22 Correct 19 ms 344 KB Output is correct
23 Correct 27 ms 444 KB Output is correct
24 Correct 28 ms 344 KB Output is correct
25 Correct 28 ms 600 KB Output is correct
26 Correct 28 ms 440 KB Output is correct
27 Correct 26 ms 600 KB Output is correct
28 Correct 22 ms 348 KB Output is correct
29 Correct 24 ms 348 KB Output is correct
30 Correct 21 ms 348 KB Output is correct
31 Correct 22 ms 348 KB Output is correct
32 Correct 23 ms 348 KB Output is correct
33 Correct 24 ms 444 KB Output is correct
34 Correct 23 ms 348 KB Output is correct
35 Correct 23 ms 344 KB Output is correct
36 Correct 23 ms 348 KB Output is correct
37 Correct 24 ms 424 KB Output is correct
38 Correct 36 ms 344 KB Output is correct
39 Correct 37 ms 344 KB Output is correct
40 Correct 23 ms 348 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 452 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 25 ms 600 KB Output is correct
17 Correct 24 ms 348 KB Output is correct
18 Correct 25 ms 600 KB Output is correct
19 Correct 25 ms 432 KB Output is correct
20 Correct 25 ms 344 KB Output is correct
21 Correct 23 ms 348 KB Output is correct
22 Correct 28 ms 348 KB Output is correct
23 Correct 26 ms 348 KB Output is correct
24 Correct 25 ms 348 KB Output is correct
25 Correct 25 ms 348 KB Output is correct
26 Correct 26 ms 440 KB Output is correct
27 Correct 25 ms 348 KB Output is correct
28 Correct 15 ms 348 KB Output is correct
29 Correct 19 ms 344 KB Output is correct
30 Correct 27 ms 444 KB Output is correct
31 Correct 28 ms 344 KB Output is correct
32 Correct 28 ms 600 KB Output is correct
33 Correct 28 ms 440 KB Output is correct
34 Correct 26 ms 600 KB Output is correct
35 Correct 22 ms 348 KB Output is correct
36 Correct 24 ms 348 KB Output is correct
37 Correct 21 ms 348 KB Output is correct
38 Correct 22 ms 348 KB Output is correct
39 Correct 23 ms 348 KB Output is correct
40 Correct 24 ms 444 KB Output is correct
41 Correct 23 ms 348 KB Output is correct
42 Correct 23 ms 344 KB Output is correct
43 Correct 23 ms 348 KB Output is correct
44 Correct 24 ms 424 KB Output is correct
45 Correct 36 ms 344 KB Output is correct
46 Correct 37 ms 344 KB Output is correct
47 Correct 23 ms 348 KB Output is correct
48 Execution timed out 3564 ms 448 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 452 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 3 ms 472 KB Output is correct
26 Correct 3 ms 600 KB Output is correct
27 Correct 25 ms 600 KB Output is correct
28 Correct 24 ms 348 KB Output is correct
29 Correct 25 ms 600 KB Output is correct
30 Correct 25 ms 432 KB Output is correct
31 Correct 25 ms 344 KB Output is correct
32 Correct 23 ms 348 KB Output is correct
33 Correct 28 ms 348 KB Output is correct
34 Correct 26 ms 348 KB Output is correct
35 Correct 25 ms 348 KB Output is correct
36 Correct 25 ms 348 KB Output is correct
37 Correct 26 ms 440 KB Output is correct
38 Correct 25 ms 348 KB Output is correct
39 Correct 15 ms 348 KB Output is correct
40 Correct 19 ms 344 KB Output is correct
41 Correct 27 ms 444 KB Output is correct
42 Correct 28 ms 344 KB Output is correct
43 Correct 28 ms 600 KB Output is correct
44 Correct 28 ms 440 KB Output is correct
45 Correct 26 ms 600 KB Output is correct
46 Correct 22 ms 348 KB Output is correct
47 Correct 24 ms 348 KB Output is correct
48 Correct 21 ms 348 KB Output is correct
49 Correct 22 ms 348 KB Output is correct
50 Correct 23 ms 348 KB Output is correct
51 Correct 24 ms 444 KB Output is correct
52 Correct 23 ms 348 KB Output is correct
53 Correct 23 ms 344 KB Output is correct
54 Correct 23 ms 348 KB Output is correct
55 Correct 24 ms 424 KB Output is correct
56 Correct 36 ms 344 KB Output is correct
57 Correct 37 ms 344 KB Output is correct
58 Correct 23 ms 348 KB Output is correct
59 Execution timed out 3564 ms 448 KB Time limit exceeded
60 Halted 0 ms 0 KB -