oj.uz

Submission #1083488

# Submission time Handle Problem Language Result Execution time Memory
1083488 2024-09-03T10:07:13 Z SamueleVid Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 34948 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

constexpr int MAXN = 1024;
constexpr int MAXM = 1024;

struct segment {
    vector<ll> seg;

    segment() {
        seg.assign(2 * MAXN, 0);
    }

    void update(int x, ll d) {
        x += MAXN;
        while (x >= 1) {
            seg[x] = max(seg[x], d);
            x /= 2;
        }
    }

    ll query(int l, int r) {
        l += MAXN; r += MAXN;
        ll res = 0;
        while (l <= r) {
            if (l % 2 == 1) {
                res = max(res, seg[l]);
                l ++;
            }
            if (r % 2 == 0) {
                res = max(res, seg[r]);
                r --;
            }
            l /= 2; r /= 2;
        }
        return res;
    }
};

int L, N, X, M;
vector<ll> T;
vector<int> W, S;
vector<segment> segs(MAXM); 
vector<vector<pair<ll, int>>> sorteds(MAXM);

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

    vector<ll> t(N);
    for (int i = 0; i < N; i ++) t[i] = T[i];
    for (int s = 1; s < M; s ++) {
        // cout << " ts : ";
        // for (auto x : t) cout << x << " ";
        // cout << '\n';
        vector<pair<ll, int>> sorted;
        for (int i = 0; i < N; i ++) sorted.push_back({t[i], i});
        sort(sorted.begin(), sorted.end());
        sorteds[s] = sorted;

        ll max_e = 0;
        ll curr_max_e = 0;
        ll prev = -1;
        for (int i = 0; i < N; i ++) {
            auto [time, idx] = sorted[i];
            // cout << "idx : " << idx << '\n';
            if (time > prev) {
                max_e = max(max_e, curr_max_e);
                prev = time;
            }

            ll curr_e = t[idx] + (ll)W[idx] * (S[s] - S[s - 1]);
            // cout << "t[idx] + (ll)W[idx] * (S[s] - S[s - 1]) : " << t[idx] << " + " << W[idx] << " + " << (S[s] - S[s - 1]) << '\n'; 
            curr_max_e = max(curr_e, curr_max_e);
            t[idx] = max(curr_e, max_e);
            
            segs[s].update(i, t[idx]);
        }

    }
}

ll arrival_time(ll Y) {
    // cout << "----------------- Y : " << Y << '\n';
    ll t = Y;
    for (int s = 1; s < M; s ++) {
        // cout << "s : " << s << " con t : " << t << '\n';
        ll e = t + (ll)X * (S[s] - S[s - 1]);
        // cout << "expected : " << e << '\n';

        int k = -1;
        for (int p = MAXN; p >= 1; p /= 2) {
            if (k + p < N && sorteds[s][k + p].first < t) k += p;
        }
        // cout << "sotto di questo ci stanno " << k + 1 << " bus" << '\n';

        ll bound = segs[s].query(0, k);
        // cout << "bound : " << bound << '\n';

        t = max(bound, e);
        // cout << "nuovo t : " << t << '\n';
    }

    return t;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16728 KB Output is correct
2 Correct 7 ms 16732 KB Output is correct
3 Correct 8 ms 16728 KB Output is correct
4 Correct 7 ms 16732 KB Output is correct
5 Correct 8 ms 16732 KB Output is correct
6 Correct 11 ms 16732 KB Output is correct
7 Correct 15 ms 16976 KB Output is correct
8 Correct 16 ms 16988 KB Output is correct
9 Correct 17 ms 16988 KB Output is correct
10 Correct 16 ms 16988 KB Output is correct
11 Correct 17 ms 16988 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 8 ms 16792 KB Output is correct
3 Correct 6 ms 16732 KB Output is correct
4 Correct 7 ms 16740 KB Output is correct
5 Correct 7 ms 16988 KB Output is correct
6 Correct 8 ms 16988 KB Output is correct
7 Correct 10 ms 16988 KB Output is correct
8 Correct 8 ms 16984 KB Output is correct
9 Correct 8 ms 16988 KB Output is correct
10 Correct 8 ms 16988 KB Output is correct
11 Correct 8 ms 16988 KB Output is correct
12 Correct 8 ms 16852 KB Output is correct
13 Correct 7 ms 16976 KB Output is correct
14 Correct 11 ms 16988 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 7 ms 16728 KB Output is correct
3 Correct 7 ms 16732 KB Output is correct
4 Correct 8 ms 16728 KB Output is correct
5 Correct 7 ms 16732 KB Output is correct
6 Correct 7 ms 16732 KB Output is correct
7 Correct 8 ms 16792 KB Output is correct
8 Correct 6 ms 16732 KB Output is correct
9 Correct 8 ms 16988 KB Output is correct
10 Correct 8 ms 16988 KB Output is correct
11 Correct 7 ms 16988 KB Output is correct
12 Correct 8 ms 16988 KB Output is correct
13 Correct 8 ms 16988 KB Output is correct
14 Correct 8 ms 16984 KB Output is correct
15 Correct 8 ms 16988 KB Output is correct
16 Correct 9 ms 16984 KB Output is correct
17 Correct 8 ms 16984 KB Output is correct
18 Correct 7 ms 16988 KB Output is correct
19 Correct 7 ms 16988 KB Output is correct
20 Correct 8 ms 16988 KB Output is correct
21 Correct 10 ms 16984 KB Output is correct
22 Correct 8 ms 16984 KB Output is correct
23 Correct 8 ms 16984 KB Output is correct
24 Correct 8 ms 16988 KB Output is correct
25 Correct 8 ms 16988 KB Output is correct
26 Correct 8 ms 16988 KB Output is correct
27 Correct 8 ms 16988 KB Output is correct
28 Correct 8 ms 16984 KB Output is correct
29 Correct 8 ms 16988 KB Output is correct
30 Correct 8 ms 16984 KB Output is correct
31 Correct 8 ms 16988 KB Output is correct
32 Correct 8 ms 17036 KB Output is correct
33 Correct 8 ms 17044 KB Output is correct
34 Correct 8 ms 16988 KB Output is correct
35 Correct 7 ms 16988 KB Output is correct
36 Correct 12 ms 16984 KB Output is correct
37 Correct 8 ms 16988 KB Output is correct
38 Correct 7 ms 16988 KB Output is correct
39 Correct 7 ms 16976 KB Output is correct
40 Correct 7 ms 16988 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 7 ms 16728 KB Output is correct
3 Correct 7 ms 16732 KB Output is correct
4 Correct 8 ms 16728 KB Output is correct
5 Correct 7 ms 16732 KB Output is correct
6 Correct 8 ms 16732 KB Output is correct
7 Correct 11 ms 16732 KB Output is correct
8 Correct 15 ms 16976 KB Output is correct
9 Correct 16 ms 16988 KB Output is correct
10 Correct 17 ms 16988 KB Output is correct
11 Correct 16 ms 16988 KB Output is correct
12 Correct 17 ms 16988 KB Output is correct
13 Correct 7 ms 16732 KB Output is correct
14 Correct 8 ms 16792 KB Output is correct
15 Correct 6 ms 16732 KB Output is correct
16 Correct 8 ms 16988 KB Output is correct
17 Correct 8 ms 16988 KB Output is correct
18 Correct 7 ms 16988 KB Output is correct
19 Correct 8 ms 16988 KB Output is correct
20 Correct 8 ms 16988 KB Output is correct
21 Correct 8 ms 16984 KB Output is correct
22 Correct 8 ms 16988 KB Output is correct
23 Correct 9 ms 16984 KB Output is correct
24 Correct 8 ms 16984 KB Output is correct
25 Correct 7 ms 16988 KB Output is correct
26 Correct 7 ms 16988 KB Output is correct
27 Correct 8 ms 16988 KB Output is correct
28 Correct 10 ms 16984 KB Output is correct
29 Correct 8 ms 16984 KB Output is correct
30 Correct 8 ms 16984 KB Output is correct
31 Correct 8 ms 16988 KB Output is correct
32 Correct 8 ms 16988 KB Output is correct
33 Correct 8 ms 16988 KB Output is correct
34 Correct 8 ms 16988 KB Output is correct
35 Correct 8 ms 16984 KB Output is correct
36 Correct 8 ms 16988 KB Output is correct
37 Correct 8 ms 16984 KB Output is correct
38 Correct 8 ms 16988 KB Output is correct
39 Correct 8 ms 17036 KB Output is correct
40 Correct 8 ms 17044 KB Output is correct
41 Correct 8 ms 16988 KB Output is correct
42 Correct 7 ms 16988 KB Output is correct
43 Correct 12 ms 16984 KB Output is correct
44 Correct 8 ms 16988 KB Output is correct
45 Correct 7 ms 16988 KB Output is correct
46 Correct 7 ms 16976 KB Output is correct
47 Correct 7 ms 16988 KB Output is correct
48 Correct 222 ms 32524 KB Output is correct
49 Correct 1106 ms 32772 KB Output is correct
50 Correct 1077 ms 32596 KB Output is correct
51 Correct 1062 ms 32772 KB Output is correct
52 Correct 1092 ms 32772 KB Output is correct
53 Correct 1096 ms 32772 KB Output is correct
54 Correct 1088 ms 32780 KB Output is correct
55 Correct 202 ms 32644 KB Output is correct
56 Correct 1069 ms 32596 KB Output is correct
57 Correct 1083 ms 32600 KB Output is correct
58 Correct 1089 ms 32848 KB Output is correct
59 Correct 1065 ms 32704 KB Output is correct
60 Correct 1081 ms 32756 KB Output is correct
61 Correct 1078 ms 32592 KB Output is correct
62 Correct 53 ms 16984 KB Output is correct
63 Correct 9 ms 16988 KB Output is correct
64 Correct 825 ms 24896 KB Output is correct
65 Correct 579 ms 24916 KB Output is correct
66 Correct 1284 ms 32696 KB Output is correct
67 Correct 1402 ms 32848 KB Output is correct
68 Correct 1466 ms 32796 KB Output is correct
69 Correct 1537 ms 32592 KB Output is correct
70 Correct 1526 ms 32592 KB Output is correct
71 Correct 1479 ms 32664 KB Output is correct
72 Correct 1506 ms 32784 KB Output is correct
73 Correct 1540 ms 32600 KB Output is correct
74 Correct 1579 ms 32780 KB Output is correct
75 Correct 1344 ms 32596 KB Output is correct
76 Correct 1290 ms 32784 KB Output is correct
77 Correct 1270 ms 32776 KB Output is correct
78 Correct 888 ms 32600 KB Output is correct

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16732 KB Output is correct
2 Correct 7 ms 16728 KB Output is correct
3 Correct 7 ms 16732 KB Output is correct
4 Correct 8 ms 16728 KB Output is correct
5 Correct 7 ms 16732 KB Output is correct
6 Correct 8 ms 16732 KB Output is correct
7 Correct 11 ms 16732 KB Output is correct
8 Correct 15 ms 16976 KB Output is correct
9 Correct 16 ms 16988 KB Output is correct
10 Correct 17 ms 16988 KB Output is correct
11 Correct 16 ms 16988 KB Output is correct
12 Correct 17 ms 16988 KB Output is correct
13 Correct 7 ms 16732 KB Output is correct
14 Correct 8 ms 16792 KB Output is correct
15 Correct 6 ms 16732 KB Output is correct
16 Correct 7 ms 16740 KB Output is correct
17 Correct 7 ms 16988 KB Output is correct
18 Correct 8 ms 16988 KB Output is correct
19 Correct 10 ms 16988 KB Output is correct
20 Correct 8 ms 16984 KB Output is correct
21 Correct 8 ms 16988 KB Output is correct
22 Correct 8 ms 16988 KB Output is correct
23 Correct 8 ms 16988 KB Output is correct
24 Correct 8 ms 16852 KB Output is correct
25 Correct 7 ms 16976 KB Output is correct
26 Correct 11 ms 16988 KB Output is correct
27 Correct 8 ms 16988 KB Output is correct
28 Correct 8 ms 16988 KB Output is correct
29 Correct 7 ms 16988 KB Output is correct
30 Correct 8 ms 16988 KB Output is correct
31 Correct 8 ms 16988 KB Output is correct
32 Correct 8 ms 16984 KB Output is correct
33 Correct 8 ms 16988 KB Output is correct
34 Correct 9 ms 16984 KB Output is correct
35 Correct 8 ms 16984 KB Output is correct
36 Correct 7 ms 16988 KB Output is correct
37 Correct 7 ms 16988 KB Output is correct
38 Correct 8 ms 16988 KB Output is correct
39 Correct 10 ms 16984 KB Output is correct
40 Correct 8 ms 16984 KB Output is correct
41 Correct 8 ms 16984 KB Output is correct
42 Correct 8 ms 16988 KB Output is correct
43 Correct 8 ms 16988 KB Output is correct
44 Correct 8 ms 16988 KB Output is correct
45 Correct 8 ms 16988 KB Output is correct
46 Correct 8 ms 16984 KB Output is correct
47 Correct 8 ms 16988 KB Output is correct
48 Correct 8 ms 16984 KB Output is correct
49 Correct 8 ms 16988 KB Output is correct
50 Correct 8 ms 17036 KB Output is correct
51 Correct 8 ms 17044 KB Output is correct
52 Correct 8 ms 16988 KB Output is correct
53 Correct 7 ms 16988 KB Output is correct
54 Correct 12 ms 16984 KB Output is correct
55 Correct 8 ms 16988 KB Output is correct
56 Correct 7 ms 16988 KB Output is correct
57 Correct 7 ms 16976 KB Output is correct
58 Correct 7 ms 16988 KB Output is correct
59 Correct 222 ms 32524 KB Output is correct
60 Correct 1106 ms 32772 KB Output is correct
61 Correct 1077 ms 32596 KB Output is correct
62 Correct 1062 ms 32772 KB Output is correct
63 Correct 1092 ms 32772 KB Output is correct
64 Correct 1096 ms 32772 KB Output is correct
65 Correct 1088 ms 32780 KB Output is correct
66 Correct 202 ms 32644 KB Output is correct
67 Correct 1069 ms 32596 KB Output is correct
68 Correct 1083 ms 32600 KB Output is correct
69 Correct 1089 ms 32848 KB Output is correct
70 Correct 1065 ms 32704 KB Output is correct
71 Correct 1081 ms 32756 KB Output is correct
72 Correct 1078 ms 32592 KB Output is correct
73 Correct 53 ms 16984 KB Output is correct
74 Correct 9 ms 16988 KB Output is correct
75 Correct 825 ms 24896 KB Output is correct
76 Correct 579 ms 24916 KB Output is correct
77 Correct 1284 ms 32696 KB Output is correct
78 Correct 1402 ms 32848 KB Output is correct
79 Correct 1466 ms 32796 KB Output is correct
80 Correct 1537 ms 32592 KB Output is correct
81 Correct 1526 ms 32592 KB Output is correct
82 Correct 1479 ms 32664 KB Output is correct
83 Correct 1506 ms 32784 KB Output is correct
84 Correct 1540 ms 32600 KB Output is correct
85 Correct 1579 ms 32780 KB Output is correct
86 Correct 1344 ms 32596 KB Output is correct
87 Correct 1290 ms 32784 KB Output is correct
88 Correct 1270 ms 32776 KB Output is correct
89 Correct 888 ms 32600 KB Output is correct
90 Execution timed out 3521 ms 34948 KB Time limit exceeded
91 Halted 0 ms 0 KB -