oj.uz

Submission #997285

# Submission time Handle Problem Language Result Execution time Memory
997285 2024-06-12T02:18:07 Z biank Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 34644 KB 
#include <bits/stdc++.h>

using namespace std;

#define sz(x) int(x.size())
#define all(x) begin(x), end(x)

using ll = long long;

const ll INF = 1e18;

vector<ll> times;
vector<int> s, w;
vector<vector<ll>> e, t;
vector<vector<pair<ll, ll>>> order;
int v, m, x;

void init(int L, int N, vector<ll> T, vector<int> W, int X, int M, vector<int> S) {
    for (int i = 0; i < N; i++) {
        if (W[i] <= X) continue;
        w.push_back(W[i]);
        times.push_back(T[i]);
    }
    m = M;
    x = X;
    s = S;
    N = sz(w);
    e.assign(M, vector<ll>(N));
    t.assign(M, vector<ll>(N));
    for (int i = 0; i < N; i++) {
        t[0][i] = times[i];
    }
    for (int i = 1; i < M; i++) {
        for (int j = 0; j < N; j++) {
            e[i][j] = t[i - 1][j] + 1LL * w[j] * (s[i] - s[i - 1]);
        }
        vector<int> p(N);
        iota(all(p), 0);
        sort(all(p), [&](int a, int b) {
            return t[i - 1][a] < t[i - 1][b];
        });
        ll prev = -1;
        order.push_back({{-1, -1}});
        for (int j = 0; j < N; j++) {
            int k = j;
            while (k + 1 < N && t[i - 1][p[k]] == t[i - 1][p[k + 1]]) {
                t[i][p[k]] = max(e[i][p[k]], prev);
                k++;
            }
            t[i][p[k]] = max(e[i][p[k]], prev);
            k = j;
            while (k + 1 < N && t[i - 1][p[k]] == t[i - 1][p[k + 1]]) {
                prev = max(prev, e[i][p[k]]);
                k++;
            }
            prev = max(prev, e[i][p[k]]);
            order.back().emplace_back(t[i - 1][p[k]], prev);
            j = k;
        }
    }
}

ll arrival_time(ll Y) {
    vector<ll> reserveT(m);
    vector<ll> reserveE(m);
    reserveT[0] = Y;
    for (int i = 1; i < m; i++) {
        reserveE[i] = reserveT[i - 1] + 1LL * x * (s[i] - s[i - 1]);
        auto it = lower_bound(all(order[i - 1]), pair<ll, ll>{reserveT[i - 1], -1});
        --it;
        reserveT[i] = max(reserveE[i], it->second);
    }
    return reserveT[m - 1];
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 432 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 636 KB Output is correct
8 Correct 4 ms 672 KB Output is correct
9 Correct 4 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 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 600 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 448 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 476 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 432 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 1 ms 856 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 600 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 600 KB Output is correct
19 Correct 1 ms 688 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 600 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 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 600 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 1 ms 600 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 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 432 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 636 KB Output is correct
9 Correct 4 ms 672 KB Output is correct
10 Correct 4 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 348 KB Output is correct
16 Correct 1 ms 856 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 600 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 600 KB Output is correct
26 Correct 1 ms 688 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 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 604 KB Output is correct
40 Correct 1 ms 604 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 600 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 600 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 68 ms 32088 KB Output is correct
49 Correct 195 ms 32436 KB Output is correct
50 Correct 198 ms 32440 KB Output is correct
51 Correct 194 ms 32444 KB Output is correct
52 Correct 193 ms 32432 KB Output is correct
53 Correct 196 ms 32444 KB Output is correct
54 Correct 180 ms 32440 KB Output is correct
55 Correct 76 ms 29520 KB Output is correct
56 Correct 166 ms 32336 KB Output is correct
57 Correct 157 ms 32340 KB Output is correct
58 Correct 174 ms 32376 KB Output is correct
59 Correct 176 ms 32340 KB Output is correct
60 Correct 169 ms 32336 KB Output is correct
61 Correct 171 ms 32300 KB Output is correct
62 Correct 17 ms 860 KB Output is correct
63 Correct 2 ms 604 KB Output is correct
64 Correct 197 ms 16576 KB Output is correct
65 Correct 178 ms 16464 KB Output is correct
66 Correct 356 ms 31900 KB Output is correct
67 Correct 354 ms 32340 KB Output is correct
68 Correct 352 ms 32392 KB Output is correct
69 Correct 134 ms 32340 KB Output is correct
70 Correct 134 ms 32340 KB Output is correct
71 Correct 134 ms 32332 KB Output is correct
72 Correct 141 ms 32296 KB Output is correct
73 Correct 142 ms 32340 KB Output is correct
74 Correct 151 ms 32440 KB Output is correct
75 Correct 15 ms 604 KB Output is correct
76 Correct 15 ms 724 KB Output is correct
77 Correct 15 ms 604 KB Output is correct
78 Correct 133 ms 32348 KB Output is correct

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 432 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 636 KB Output is correct
9 Correct 4 ms 672 KB Output is correct
10 Correct 4 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 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 600 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 448 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 476 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 856 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 600 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 600 KB Output is correct
37 Correct 1 ms 688 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
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 600 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 604 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 1 ms 604 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 600 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 600 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 68 ms 32088 KB Output is correct
60 Correct 195 ms 32436 KB Output is correct
61 Correct 198 ms 32440 KB Output is correct
62 Correct 194 ms 32444 KB Output is correct
63 Correct 193 ms 32432 KB Output is correct
64 Correct 196 ms 32444 KB Output is correct
65 Correct 180 ms 32440 KB Output is correct
66 Correct 76 ms 29520 KB Output is correct
67 Correct 166 ms 32336 KB Output is correct
68 Correct 157 ms 32340 KB Output is correct
69 Correct 174 ms 32376 KB Output is correct
70 Correct 176 ms 32340 KB Output is correct
71 Correct 169 ms 32336 KB Output is correct
72 Correct 171 ms 32300 KB Output is correct
73 Correct 17 ms 860 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 197 ms 16576 KB Output is correct
76 Correct 178 ms 16464 KB Output is correct
77 Correct 356 ms 31900 KB Output is correct
78 Correct 354 ms 32340 KB Output is correct
79 Correct 352 ms 32392 KB Output is correct
80 Correct 134 ms 32340 KB Output is correct
81 Correct 134 ms 32340 KB Output is correct
82 Correct 134 ms 32332 KB Output is correct
83 Correct 141 ms 32296 KB Output is correct
84 Correct 142 ms 32340 KB Output is correct
85 Correct 151 ms 32440 KB Output is correct
86 Correct 15 ms 604 KB Output is correct
87 Correct 15 ms 724 KB Output is correct
88 Correct 15 ms 604 KB Output is correct
89 Correct 133 ms 32348 KB Output is correct
90 Execution timed out 3555 ms 34644 KB Time limit exceeded
91 Halted 0 ms 0 KB -