oj.uz

Submission #1000032

# Submission time Handle Problem Language Result Execution time Memory
1000032 2024-06-16T13:35:01 Z abczz Overtaking (IOI23_overtaking) C++17
100 / 100
 468 ms 67260 KB 
#include "overtaking.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#define ll long long

using namespace std;

vector <array<ll, 2>> A;
vector <ll> U;
vector <vector <ll>> V;
vector <vector <array<ll, 2>>> nx;
ll z;
void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S)
{
    A.clear();
    U.clear();
    V.resize(M);
    nx.resize(M);
    z = X;
    for (auto u : S) U.push_back(u);
    for (int i=0; i<N; ++i) {
        if (W[i] > X) {
            A.push_back({T[i], W[i]});
        }
    }
    if (A.empty()) return;
    ll p, l, r, mid;
    for (int i=0; i<M; ++i) {
        p = 0;
        sort(A.begin(), A.end(), [](auto a, auto b) {
            return a[0] < b[0] || (a[0] == b[0] && a[1] < b[1]);
        });
        for (auto [x, y] : A) V[i].push_back(x);
        if (i == M-1) continue;
        for (auto &[x, y] : A) {
            x += (U[i+1]-U[i]) * y;
            p = x = max(p, x);
        }
    }
    nx[M-1].resize(V[0].size());
    for (int j=0; j<V[0].size(); ++j) nx[M-1][j] = {M-1, j};
    for (int i=M-2; i>=0; --i) {
        nx[i].resize(V[i].size());
        nx[i][0] = {i, 0};
        for (int j=1; j<V[i].size(); ++j) {
            l = i, r = M-1, mid;
            while (l < r) {
                mid = (l+r)/2;
                if (V[i][j]+(U[mid]-U[i]) * z <= V[mid][j-1]) r = mid;
                else l = mid+1;
            }
            if (V[i][j]+(U[l]-U[i]) * z <= V[l][j-1]) {
                nx[i][j] = nx[l][lower_bound(V[l].begin(), V[l].end(), V[l][j-1])-V[l].begin()];
            }
            else nx[i][j] = {i, j};
        }
    }
    return;
}

long long arrival_time(long long Y)
{
    if (V[0].empty()) return Y + U.back() * z;
    ll l, r, mid;
    l = 0, r = V[0].size()-1;
    while (l < r) {
        mid = (l+r+1)/2;
        if (V[0][mid] >= Y) r = mid-1;
        else l = mid;
    }
    if (V[0][l] >= Y) return Y + U.back() * z;
    ll a = l;
    l = 0, r = U.size()-1;
    while (l < r) {
        mid = (l+r)/2;
        if (Y+(U[mid] * z) <= V[mid][a]) r = mid;
        else l = mid+1;
    }
    if (Y+(U[l] * z) <= V[l][a]) {
        auto b = nx[l][a];
        return V[b[0]][b[1]] + (U.back()-U[b[0]]) * z;
    }
    else return Y + U.back() * z;
}

Compilation message

overtaking.cpp: In function 'void init(int, int, std::vector<long long int>, std::vector<int>, int, int, std::vector<int>)':
overtaking.cpp:43:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for (int j=0; j<V[0].size(); ++j) nx[M-1][j] = {M-1, j};
      |                   ~^~~~~~~~~~~~
overtaking.cpp:47:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for (int j=1; j<V[i].size(); ++j) {
      |                       ~^~~~~~~~~~~~
overtaking.cpp:48:32: warning: right operand of comma operator has no effect [-Wunused-value]
   48 |             l = i, r = M-1, mid;
      |                                ^

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 344 KB Output is correct
2 Correct 0 ms 360 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 1 ms 600 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 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 1 ms 348 KB Output is correct
9 Correct 1 ms 344 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 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 344 KB Output is correct
3 Correct 0 ms 360 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 660 KB Output is correct
11 Correct 1 ms 692 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 604 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 648 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 556 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 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 692 KB Output is correct
33 Correct 1 ms 856 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 692 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 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 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 360 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 1 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 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 604 KB Output is correct
17 Correct 1 ms 660 KB Output is correct
18 Correct 1 ms 692 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 604 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 648 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 556 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 692 KB Output is correct
40 Correct 1 ms 856 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 692 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 122 ms 24148 KB Output is correct
49 Correct 118 ms 24248 KB Output is correct
50 Correct 113 ms 24404 KB Output is correct
51 Correct 106 ms 24324 KB Output is correct
52 Correct 107 ms 24288 KB Output is correct
53 Correct 103 ms 24388 KB Output is correct
54 Correct 108 ms 24404 KB Output is correct
55 Correct 68 ms 24112 KB Output is correct
56 Correct 99 ms 24400 KB Output is correct
57 Correct 82 ms 24400 KB Output is correct
58 Correct 82 ms 24404 KB Output is correct
59 Correct 84 ms 24404 KB Output is correct
60 Correct 80 ms 24400 KB Output is correct
61 Correct 83 ms 24400 KB Output is correct
62 Correct 2 ms 600 KB Output is correct
63 Correct 2 ms 568 KB Output is correct
64 Correct 37 ms 12460 KB Output is correct
65 Correct 42 ms 12368 KB Output is correct
66 Correct 64 ms 24400 KB Output is correct
67 Correct 77 ms 24404 KB Output is correct
68 Correct 82 ms 24400 KB Output is correct
69 Correct 36 ms 24400 KB Output is correct
70 Correct 34 ms 24408 KB Output is correct
71 Correct 34 ms 24400 KB Output is correct
72 Correct 68 ms 24400 KB Output is correct
73 Correct 37 ms 24404 KB Output is correct
74 Correct 40 ms 24420 KB Output is correct
75 Correct 2 ms 600 KB Output is correct
76 Correct 1 ms 604 KB Output is correct
77 Correct 1 ms 604 KB Output is correct
78 Correct 50 ms 24328 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 360 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 1 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 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 0 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 344 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 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 660 KB Output is correct
29 Correct 1 ms 692 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 604 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 648 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 556 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 692 KB Output is correct
51 Correct 1 ms 856 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 692 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 122 ms 24148 KB Output is correct
60 Correct 118 ms 24248 KB Output is correct
61 Correct 113 ms 24404 KB Output is correct
62 Correct 106 ms 24324 KB Output is correct
63 Correct 107 ms 24288 KB Output is correct
64 Correct 103 ms 24388 KB Output is correct
65 Correct 108 ms 24404 KB Output is correct
66 Correct 68 ms 24112 KB Output is correct
67 Correct 99 ms 24400 KB Output is correct
68 Correct 82 ms 24400 KB Output is correct
69 Correct 82 ms 24404 KB Output is correct
70 Correct 84 ms 24404 KB Output is correct
71 Correct 80 ms 24400 KB Output is correct
72 Correct 83 ms 24400 KB Output is correct
73 Correct 2 ms 600 KB Output is correct
74 Correct 2 ms 568 KB Output is correct
75 Correct 37 ms 12460 KB Output is correct
76 Correct 42 ms 12368 KB Output is correct
77 Correct 64 ms 24400 KB Output is correct
78 Correct 77 ms 24404 KB Output is correct
79 Correct 82 ms 24400 KB Output is correct
80 Correct 36 ms 24400 KB Output is correct
81 Correct 34 ms 24408 KB Output is correct
82 Correct 34 ms 24400 KB Output is correct
83 Correct 68 ms 24400 KB Output is correct
84 Correct 37 ms 24404 KB Output is correct
85 Correct 40 ms 24420 KB Output is correct
86 Correct 2 ms 600 KB Output is correct
87 Correct 1 ms 604 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 50 ms 24328 KB Output is correct
90 Correct 123 ms 27316 KB Output is correct
91 Correct 319 ms 59232 KB Output is correct
92 Correct 338 ms 58556 KB Output is correct
93 Correct 310 ms 59220 KB Output is correct
94 Correct 327 ms 58964 KB Output is correct
95 Correct 325 ms 59120 KB Output is correct
96 Correct 364 ms 59216 KB Output is correct
97 Correct 89 ms 27472 KB Output is correct
98 Correct 319 ms 58824 KB Output is correct
99 Correct 316 ms 59984 KB Output is correct
100 Correct 322 ms 59340 KB Output is correct
101 Correct 308 ms 58684 KB Output is correct
102 Correct 314 ms 58796 KB Output is correct
103 Correct 325 ms 59028 KB Output is correct
104 Correct 251 ms 45392 KB Output is correct
105 Correct 301 ms 49748 KB Output is correct
106 Correct 341 ms 67260 KB Output is correct
107 Correct 319 ms 66900 KB Output is correct
108 Correct 350 ms 67008 KB Output is correct
109 Correct 314 ms 66896 KB Output is correct
110 Correct 327 ms 67152 KB Output is correct
111 Correct 240 ms 59472 KB Output is correct
112 Correct 239 ms 59476 KB Output is correct
113 Correct 314 ms 60452 KB Output is correct
114 Correct 425 ms 61632 KB Output is correct
115 Correct 295 ms 59576 KB Output is correct
116 Correct 255 ms 60496 KB Output is correct
117 Correct 169 ms 39252 KB Output is correct
118 Correct 171 ms 39504 KB Output is correct
119 Correct 216 ms 37460 KB Output is correct
120 Correct 171 ms 39508 KB Output is correct
121 Correct 172 ms 40784 KB Output is correct
122 Correct 298 ms 53432 KB Output is correct
123 Correct 468 ms 61380 KB Output is correct
124 Correct 450 ms 61524 KB Output is correct
125 Correct 445 ms 61520 KB Output is correct