oj.uz

Submission #843217

# Submission time Handle Problem Language Result Execution time Memory
843217 2023-09-03T19:32:52 Z yutabi Overtaking (IOI23_overtaking) C++17
100 / 100
 530 ms 53692 KB 
#include <bits/stdc++.h>
#include "overtaking.h"
using namespace std;
    
    
    
typedef long long ll;
typedef pair <ll,int> bus;
    
    
    
bus busses[1001][1001];
    
ll stuck[1001][1001];
    
int n;
int m;
    
vector <int> s;
    
int x;

bool yolo;
    
void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S)
{
    n=N;
    m=M;
    s=S;
    x=X;
    
    for(int i=0;i<M;i++)
    {
        multiset <bus> st;
        
        if(i==0)
        {
            int skipped=0;
    
            for(int j=0;j<N;j++)
            {
                if(W[j]<=X)
                {
                    skipped++;
    
                    continue;
                }
    
                st.insert({T[j],W[j]});
            }
    
            N-=skipped;
            n-=skipped;

            if(N==0)
            {
                yolo=true;
                return;
            }
    
            for(int j=0;j<N;j++)
            {
                if(st.empty())
                {
                    assert(0);
                }

                busses[0][j]=*(st.begin());
                st.erase(st.begin());
            }
    
            continue;
        }
    
        ll maxi=-1;
    
        for(int j=0;j<N;j++)
        {
            bus curr=busses[i-1][j];
            
            curr.first+=((ll)(S[i]-S[i-1]))*curr.second;
    
            if(curr.first>maxi)
            {
                maxi=curr.first;
            }
    
            else
            {
                curr.first=maxi;
            }
            
            st.insert(curr);
        }
        
        for(int j=0;j<N;j++)
        {
            busses[i][j]=*st.begin();
            st.erase(st.begin());
        }
    }
    
    /*for(int i=0;i<M;i++)
    {
        for(int j=0;j<N;j++)
        {
            printf("%lld %d ",busses[i][j].time,busses[i][j].speed);
        }
    
        printf("\n");
    }*/
    
    for(int i=M-1;i>0;i--)
    {
        for(int j=0;j<N;j++)
        {
            ll curr=busses[i][j].first;
    
            if(i==M-1)
            {
                stuck[i][j]=curr;
    
                continue;
            }
    
            if(j==0)
            {
                stuck[i][j]=curr+((ll)(S[M-1]-S[i]))*X;
    
                continue;
            }
    
            if(j>0 && busses[i][j].first==busses[i][j-1].first)
            {
                stuck[i][j]=stuck[i][j-1];
    
                continue;
            }
    
            int curr_loc=i;
    
            for(int k=9;k>=0;k--)
            {
                int next_loc=curr_loc+(1<<k);
                next_loc=min(next_loc,M-1);
    
                ll nxt=curr;
    
                nxt+=((ll)(S[next_loc]-S[i]))*X;
    
                if(nxt>busses[next_loc][j-1].first)
                {
                    curr_loc=next_loc;
                }
            }
    
            curr_loc++;
    
            if(curr_loc==M)
            {
                stuck[i][j]=curr+((ll)(S[M-1]-S[i]))*X;
    
                continue;
            }
    
            stuck[i][j]=stuck[curr_loc][j-1];
        }
    }
    
    /*for(int i=1;i<M;i++)
    {
        for(int j=0;j<N;j++)
        {
            printf("%lld ",stuck[i][j]);
        }
    
        printf("\n");
    }*/
    
    return;
}
    
long long arrival_time(long long Y)
{
    if(yolo)
    {
        return Y+((ll)(s[m-1]-s[0]))*x;
    }

    int j=n;
    
    for(int k=9;k>=0;k--)
    {
        int next_j=max(0,j-(1<<k));
    
    
    
        if(Y<=busses[0][next_j].first)
        {
            j=next_j;
        }
    }
    
    j--;
    
    if(j==-1)
    {
        return Y+((ll)(s[m-1]-s[0]))*x;
    }
    
    int curr=0;
    
    for(int k=9;k>=0;k--)
    {
        int nxt=min(curr+(1<<k),m-1);
    
        ll t=Y+((ll)(s[nxt]-s[0]))*x;
    
        if(t>busses[nxt][j].first)
        {
            curr=nxt;
        }
    }
    
    curr++;
    
    if(curr==m)
    {
        return Y+((ll)(s[m-1]-s[0]))*x;
    }
    
    return stuck[curr][j];
}

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 12892 KB Output is correct
7 Correct 3 ms 21080 KB Output is correct
8 Correct 3 ms 23132 KB Output is correct
9 Correct 3 ms 23132 KB Output is correct
10 Correct 3 ms 23132 KB Output is correct
11 Correct 1 ms 344 KB Output is correct

Subtask #2
10.0 / 10.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 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 456 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 6488 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6488 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 2 ms 6648 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 1 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 2 ms 6492 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 2 ms 6596 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 3 ms 21080 KB Output is correct
9 Correct 3 ms 23132 KB Output is correct
10 Correct 3 ms 23132 KB Output is correct
11 Correct 3 ms 23132 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6488 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6648 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 2 ms 6492 KB Output is correct
38 Correct 1 ms 6492 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 2 ms 6492 KB Output is correct
41 Correct 2 ms 6492 KB Output is correct
42 Correct 2 ms 6492 KB Output is correct
43 Correct 2 ms 6492 KB Output is correct
44 Correct 2 ms 6492 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 2 ms 6596 KB Output is correct
48 Correct 115 ms 23832 KB Output is correct
49 Correct 116 ms 23888 KB Output is correct
50 Correct 130 ms 23888 KB Output is correct
51 Correct 118 ms 23892 KB Output is correct
52 Correct 117 ms 23888 KB Output is correct
53 Correct 117 ms 23888 KB Output is correct
54 Correct 124 ms 23892 KB Output is correct
55 Correct 116 ms 24088 KB Output is correct
56 Correct 111 ms 23892 KB Output is correct
57 Correct 111 ms 23880 KB Output is correct
58 Correct 124 ms 23884 KB Output is correct
59 Correct 113 ms 23868 KB Output is correct
60 Correct 112 ms 23864 KB Output is correct
61 Correct 112 ms 23888 KB Output is correct
62 Correct 4 ms 23388 KB Output is correct
63 Correct 2 ms 2648 KB Output is correct
64 Correct 58 ms 23652 KB Output is correct
65 Correct 60 ms 15412 KB Output is correct
66 Correct 112 ms 24132 KB Output is correct
67 Correct 118 ms 24104 KB Output is correct
68 Correct 117 ms 24336 KB Output is correct
69 Correct 127 ms 23892 KB Output is correct
70 Correct 112 ms 23892 KB Output is correct
71 Correct 111 ms 24120 KB Output is correct
72 Correct 133 ms 24088 KB Output is correct
73 Correct 110 ms 23892 KB Output is correct
74 Correct 109 ms 23892 KB Output is correct
75 Correct 1 ms 600 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 111 ms 23860 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 3 ms 21080 KB Output is correct
9 Correct 3 ms 23132 KB Output is correct
10 Correct 3 ms 23132 KB Output is correct
11 Correct 3 ms 23132 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 2 ms 2396 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 2 ms 6488 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6492 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 2 ms 6492 KB Output is correct
38 Correct 2 ms 6488 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 2 ms 6492 KB Output is correct
41 Correct 2 ms 6492 KB Output is correct
42 Correct 2 ms 6492 KB Output is correct
43 Correct 2 ms 6492 KB Output is correct
44 Correct 2 ms 6492 KB Output is correct
45 Correct 2 ms 6492 KB Output is correct
46 Correct 2 ms 6648 KB Output is correct
47 Correct 2 ms 6492 KB Output is correct
48 Correct 2 ms 6492 KB Output is correct
49 Correct 1 ms 6492 KB Output is correct
50 Correct 2 ms 6492 KB Output is correct
51 Correct 2 ms 6492 KB Output is correct
52 Correct 2 ms 6492 KB Output is correct
53 Correct 2 ms 6492 KB Output is correct
54 Correct 2 ms 6492 KB Output is correct
55 Correct 2 ms 6492 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 2 ms 6596 KB Output is correct
59 Correct 115 ms 23832 KB Output is correct
60 Correct 116 ms 23888 KB Output is correct
61 Correct 130 ms 23888 KB Output is correct
62 Correct 118 ms 23892 KB Output is correct
63 Correct 117 ms 23888 KB Output is correct
64 Correct 117 ms 23888 KB Output is correct
65 Correct 124 ms 23892 KB Output is correct
66 Correct 116 ms 24088 KB Output is correct
67 Correct 111 ms 23892 KB Output is correct
68 Correct 111 ms 23880 KB Output is correct
69 Correct 124 ms 23884 KB Output is correct
70 Correct 113 ms 23868 KB Output is correct
71 Correct 112 ms 23864 KB Output is correct
72 Correct 112 ms 23888 KB Output is correct
73 Correct 4 ms 23388 KB Output is correct
74 Correct 2 ms 2648 KB Output is correct
75 Correct 58 ms 23652 KB Output is correct
76 Correct 60 ms 15412 KB Output is correct
77 Correct 112 ms 24132 KB Output is correct
78 Correct 118 ms 24104 KB Output is correct
79 Correct 117 ms 24336 KB Output is correct
80 Correct 127 ms 23892 KB Output is correct
81 Correct 112 ms 23892 KB Output is correct
82 Correct 111 ms 24120 KB Output is correct
83 Correct 133 ms 24088 KB Output is correct
84 Correct 110 ms 23892 KB Output is correct
85 Correct 109 ms 23892 KB Output is correct
86 Correct 1 ms 600 KB Output is correct
87 Correct 1 ms 348 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 111 ms 23860 KB Output is correct
90 Correct 138 ms 26424 KB Output is correct
91 Correct 377 ms 49432 KB Output is correct
92 Correct 372 ms 49232 KB Output is correct
93 Correct 396 ms 49412 KB Output is correct
94 Correct 401 ms 49328 KB Output is correct
95 Correct 372 ms 49360 KB Output is correct
96 Correct 378 ms 49424 KB Output is correct
97 Correct 126 ms 26452 KB Output is correct
98 Correct 361 ms 49340 KB Output is correct
99 Correct 353 ms 49796 KB Output is correct
100 Correct 353 ms 49356 KB Output is correct
101 Correct 359 ms 49232 KB Output is correct
102 Correct 360 ms 49252 KB Output is correct
103 Correct 351 ms 49512 KB Output is correct
104 Correct 325 ms 48460 KB Output is correct
105 Correct 345 ms 41812 KB Output is correct
106 Correct 383 ms 53628 KB Output is correct
107 Correct 379 ms 53620 KB Output is correct
108 Correct 388 ms 53692 KB Output is correct
109 Correct 383 ms 53588 KB Output is correct
110 Correct 382 ms 53600 KB Output is correct
111 Correct 371 ms 49748 KB Output is correct
112 Correct 377 ms 49572 KB Output is correct
113 Correct 438 ms 50768 KB Output is correct
114 Correct 477 ms 51536 KB Output is correct
115 Correct 442 ms 50512 KB Output is correct
116 Correct 375 ms 50512 KB Output is correct
117 Correct 196 ms 28172 KB Output is correct
118 Correct 178 ms 27984 KB Output is correct
119 Correct 174 ms 27124 KB Output is correct
120 Correct 177 ms 28240 KB Output is correct
121 Correct 175 ms 29016 KB Output is correct
122 Correct 462 ms 46540 KB Output is correct
123 Correct 530 ms 51540 KB Output is correct
124 Correct 470 ms 51720 KB Output is correct
125 Correct 500 ms 51540 KB Output is correct