oj.uz

Submission #1064221

# Submission time Handle Problem Language Result Execution time Memory
1064221 2024-08-18T10:34:21 Z jer033 Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 49856 KB 
#include "overtaking.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using tlli = tuple<ll, ll, int>;//prev time, next time, index
using tll = tuple<ll, ll>;
const ll INF = 3'123'456'123'456'123'456;

ll L;
int N;
vector<ll> T;
vector<ll> W;
ll X;
int M;
vector<ll> S;
vector<vector<ll>> times;
vector<vector<tll>> range_map;

void init(int L1, int N1, std::vector<long long> T1, std::vector<int> W1, int X1, int M1, std::vector<int> S1)
{
    L = L1;
    N = N1;
    T = T1;
    for (int i: W1)
        W.push_back(i);
    X = X1;
    W.push_back(X);
    M = M1;
    for (int i: S1)
        S.push_back(i);


    times = vector<vector<ll>> (N+1);
    for (int i=0; i<N; i++)
        times[i].push_back(T[i]);
    for (int sorting = 1; sorting<M; sorting++)
    {
        ll length = S[sorting] - S[sorting-1];
        vector<tlli> move;
        for (int i=0; i<N; i++)
        {
            move.push_back({times[i][sorting-1], times[i][sorting-1] + (length*W[i]), i});
        }
        sort(move.begin(), move.end());
        ll running_max = -1;
        for (int j=0; j<N; j++)
        {
            running_max = max(running_max, get<1>(move[j]));
            int i = get<2>(move[j]);
            times[i].push_back(running_max);
        }
    }

    for (int sorting = 1; sorting<M; sorting++)
    {
        vector<tll> rang;
        for (int i=0; i<N; i++)
            rang.push_back({times[i][sorting-1], times[i][sorting]});
        rang.push_back({INF, INF});
        rang.push_back({-1, 0});
        sort(rang.begin(), rang.end());
        range_map.push_back(rang);
    }
}

long long arrival_time(long long Y)
{
    ll curr = Y;
    for (int sorting = 1; sorting<M; sorting++)
    {
        ll expected = ((S[sorting]-S[sorting-1])*X)+curr;
        int lo = 0;
        int hi = N+1;
        while (lo!=hi)
        {
            int mid = (lo+hi)/2;
            if (get<0>(range_map[sorting-1][mid]) >= curr)
                hi = mid;
            else
                lo = mid+1;
        }
        expected = max(expected, get<1>(range_map[sorting-1][lo-1]));
        curr = expected;
    }
    return curr;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 468 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 3 ms 604 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 344 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 1 ms 612 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 452 KB Output is correct
14 Correct 1 ms 604 KB Output is correct

Subtask #3
20.0 / 20.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 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 344 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 668 KB Output is correct
37 Correct 1 ms 856 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct

Subtask #4
26.0 / 26.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 0 ms 348 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 3 ms 604 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 344 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 600 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 668 KB Output is correct
44 Correct 1 ms 856 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 92 ms 24752 KB Output is correct
49 Correct 195 ms 24656 KB Output is correct
50 Correct 176 ms 24660 KB Output is correct
51 Correct 194 ms 24864 KB Output is correct
52 Correct 192 ms 24712 KB Output is correct
53 Correct 191 ms 24660 KB Output is correct
54 Correct 179 ms 24788 KB Output is correct
55 Correct 111 ms 24788 KB Output is correct
56 Correct 182 ms 24816 KB Output is correct
57 Correct 179 ms 24576 KB Output is correct
58 Correct 176 ms 24660 KB Output is correct
59 Correct 177 ms 24544 KB Output is correct
60 Correct 190 ms 24848 KB Output is correct
61 Correct 185 ms 24660 KB Output is correct
62 Correct 16 ms 600 KB Output is correct
63 Correct 3 ms 604 KB Output is correct
64 Correct 145 ms 12824 KB Output is correct
65 Correct 173 ms 12536 KB Output is correct
66 Correct 244 ms 24660 KB Output is correct
67 Correct 341 ms 24772 KB Output is correct
68 Correct 268 ms 24664 KB Output is correct
69 Correct 176 ms 24404 KB Output is correct
70 Correct 170 ms 24304 KB Output is correct
71 Correct 150 ms 24380 KB Output is correct
72 Correct 171 ms 24320 KB Output is correct
73 Correct 173 ms 24492 KB Output is correct
74 Correct 161 ms 24320 KB Output is correct
75 Correct 242 ms 24400 KB Output is correct
76 Correct 253 ms 24404 KB Output is correct
77 Correct 265 ms 24476 KB Output is correct
78 Correct 161 ms 24476 KB Output is correct

Subtask #5
0.0 / 35.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 0 ms 348 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 3 ms 604 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 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 612 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 444 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 452 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 1 ms 600 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 604 KB Output is correct
54 Correct 1 ms 668 KB Output is correct
55 Correct 1 ms 856 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 92 ms 24752 KB Output is correct
60 Correct 195 ms 24656 KB Output is correct
61 Correct 176 ms 24660 KB Output is correct
62 Correct 194 ms 24864 KB Output is correct
63 Correct 192 ms 24712 KB Output is correct
64 Correct 191 ms 24660 KB Output is correct
65 Correct 179 ms 24788 KB Output is correct
66 Correct 111 ms 24788 KB Output is correct
67 Correct 182 ms 24816 KB Output is correct
68 Correct 179 ms 24576 KB Output is correct
69 Correct 176 ms 24660 KB Output is correct
70 Correct 177 ms 24544 KB Output is correct
71 Correct 190 ms 24848 KB Output is correct
72 Correct 185 ms 24660 KB Output is correct
73 Correct 16 ms 600 KB Output is correct
74 Correct 3 ms 604 KB Output is correct
75 Correct 145 ms 12824 KB Output is correct
76 Correct 173 ms 12536 KB Output is correct
77 Correct 244 ms 24660 KB Output is correct
78 Correct 341 ms 24772 KB Output is correct
79 Correct 268 ms 24664 KB Output is correct
80 Correct 176 ms 24404 KB Output is correct
81 Correct 170 ms 24304 KB Output is correct
82 Correct 150 ms 24380 KB Output is correct
83 Correct 171 ms 24320 KB Output is correct
84 Correct 173 ms 24492 KB Output is correct
85 Correct 161 ms 24320 KB Output is correct
86 Correct 242 ms 24400 KB Output is correct
87 Correct 253 ms 24404 KB Output is correct
88 Correct 265 ms 24476 KB Output is correct
89 Correct 161 ms 24476 KB Output is correct
90 Correct 3259 ms 27728 KB Output is correct
91 Execution timed out 3544 ms 49856 KB Time limit exceeded
92 Halted 0 ms 0 KB -