oj.uz

Submission #847747

# Submission time Handle Problem Language Result Execution time Memory
847747 2023-09-10T10:04:33 Z vjudge1 Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 29780 KB 
#include "overtaking.h"

#include <bits/stdc++.h>
using namespace std;

#define int64_t long long

vector<int> W, S;
vector<int64_t> T;
int N, L, M, X;
vector<vector<int64_t>> e, t;
vector<vector<int>> order;
vector<vector<int64_t>> max_time;

void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S) {
        ::T = T;
        ::W = W;
        ::S = S;
        ::N = N;
        ::L = L;
        ::M = M;
        ::X = X;

        t = vector<vector<int64_t>>(M, vector<int64_t>(N));
        e = vector<vector<int64_t>>(M, vector<int64_t>(N));
        for (int i = 0; i < N; i++) t[0][i] = T[i];
        for (int i = 0; i < M - 1; i++) {
                for (int j = 0; j < N; j++) {
                        e[i + 1][j] = t[i][j] + 1ll * W[j] * (S[i + 1] - S[i]);
                }
                vector<int> ord(N);
                iota(ord.begin(), ord.end(), 0);
                sort(ord.begin(), ord.end(), [&](int a, int b) {
                        return t[i][a] < t[i][b];
                });
                order.emplace_back(ord);
                int64_t time = 0;
                max_time.emplace_back(vector<int64_t>{time});
                for (int j = 0; j < N;) {
                        int k = j;
                        while (k < N && t[i][ord[k]] == t[i][ord[j]]) k++;
                        for (int z = j; z < k; z++) t[i + 1][ord[z]] = max(time, e[i + 1][ord[z]]);
                        for (int z = j; z < k; z++) {
                                time = max(time, e[i + 1][ord[z]]);
                                max_time[i].emplace_back(time);
                        }
                        j = k;
                }
        }
}

long long arrival_time(long long Y) {
        int64_t tt = Y;
        for (int i = 0; i < M - 1; i++) {
                int64_t ee = tt + 1ll * (S[i + 1] - S[i]) * X;
                int l = 0, r = N - 1, j = N;
                while (l <= r) {
                        int mid = l + r >> 1;
                        if (tt <= t[i][order[i][mid]]) {
                                j = mid;
                                r = mid - 1;
                        } else {
                                l = mid + 1;
                        }
                }
                tt = max(max_time[i][j], ee);
        }
        return tt;
}

Compilation message

overtaking.cpp: In function 'long long int arrival_time(long long int)':
overtaking.cpp:58:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   58 |                         int mid = l + r >> 1;
      |                                   ~~^~~

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 352 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 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 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 4 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 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 1 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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 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 352 KB Output is correct
3 Correct 1 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 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 604 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 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 600 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 600 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 604 KB Output is correct
32 Correct 1 ms 600 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 856 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 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 352 KB Output is correct
3 Correct 1 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 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 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 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 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 600 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 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 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 600 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 856 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 124 ms 28244 KB Output is correct
49 Correct 262 ms 28376 KB Output is correct
50 Correct 268 ms 28376 KB Output is correct
51 Correct 303 ms 28316 KB Output is correct
52 Correct 259 ms 28376 KB Output is correct
53 Correct 253 ms 28372 KB Output is correct
54 Correct 256 ms 28276 KB Output is correct
55 Correct 109 ms 28304 KB Output is correct
56 Correct 283 ms 28240 KB Output is correct
57 Correct 273 ms 28376 KB Output is correct
58 Correct 281 ms 28376 KB Output is correct
59 Correct 246 ms 28244 KB Output is correct
60 Correct 259 ms 28240 KB Output is correct
61 Correct 260 ms 28372 KB Output is correct
62 Correct 12 ms 600 KB Output is correct
63 Correct 2 ms 604 KB Output is correct
64 Correct 326 ms 14516 KB Output is correct
65 Correct 232 ms 14452 KB Output is correct
66 Correct 594 ms 28376 KB Output is correct
67 Correct 646 ms 28376 KB Output is correct
68 Correct 647 ms 28536 KB Output is correct
69 Correct 510 ms 28244 KB Output is correct
70 Correct 530 ms 28372 KB Output is correct
71 Correct 480 ms 28372 KB Output is correct
72 Correct 530 ms 28376 KB Output is correct
73 Correct 485 ms 28376 KB Output is correct
74 Correct 461 ms 28376 KB Output is correct
75 Correct 599 ms 28376 KB Output is correct
76 Correct 682 ms 28372 KB Output is correct
77 Correct 596 ms 28384 KB Output is correct
78 Correct 275 ms 28244 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 352 KB Output is correct
3 Correct 1 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 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 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 348 KB Output is correct
20 Correct 1 ms 348 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 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 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 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 600 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 1 ms 600 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 600 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 604 KB Output is correct
50 Correct 1 ms 600 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 856 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 1 ms 604 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 124 ms 28244 KB Output is correct
60 Correct 262 ms 28376 KB Output is correct
61 Correct 268 ms 28376 KB Output is correct
62 Correct 303 ms 28316 KB Output is correct
63 Correct 259 ms 28376 KB Output is correct
64 Correct 253 ms 28372 KB Output is correct
65 Correct 256 ms 28276 KB Output is correct
66 Correct 109 ms 28304 KB Output is correct
67 Correct 283 ms 28240 KB Output is correct
68 Correct 273 ms 28376 KB Output is correct
69 Correct 281 ms 28376 KB Output is correct
70 Correct 246 ms 28244 KB Output is correct
71 Correct 259 ms 28240 KB Output is correct
72 Correct 260 ms 28372 KB Output is correct
73 Correct 12 ms 600 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 326 ms 14516 KB Output is correct
76 Correct 232 ms 14452 KB Output is correct
77 Correct 594 ms 28376 KB Output is correct
78 Correct 646 ms 28376 KB Output is correct
79 Correct 647 ms 28536 KB Output is correct
80 Correct 510 ms 28244 KB Output is correct
81 Correct 530 ms 28372 KB Output is correct
82 Correct 480 ms 28372 KB Output is correct
83 Correct 530 ms 28376 KB Output is correct
84 Correct 485 ms 28376 KB Output is correct
85 Correct 461 ms 28376 KB Output is correct
86 Correct 599 ms 28376 KB Output is correct
87 Correct 682 ms 28372 KB Output is correct
88 Correct 596 ms 28384 KB Output is correct
89 Correct 275 ms 28244 KB Output is correct
90 Execution timed out 3542 ms 29780 KB Time limit exceeded
91 Halted 0 ms 0 KB -