oj.uz

Submission #858876

# Submission time Handle Problem Language Result Execution time Memory
858876 2023-10-09T10:10:18 Z superMOOZ Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 56748 KB 
#include "overtaking.h"

#include <vector>
#include <set>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;

int L, N, X, M;
vector<long long> T;
vector<int> W, S;


pair<long long, int> arrival_vec[1005][1005];  // [stop][rank] = {time, id}
long long arrival_t[1005][1005];  // [stop][id]

vector<pair<long long, long long>> info[1005];  // sorted - [stop][..] = {from time, earliest arrival}

void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S)
{
    ::L = L;
    ::N = N;
    ::T = T;
    ::W = W;
    ::X = X;
    ::M = M;
    ::S = S;
    for (int i=0; i<N; ++i) {
        arrival_vec[0][i] = {T[i], i};
        arrival_t[0][i] = T[i];
    }
    sort(arrival_vec[0], arrival_vec[0] + N);
    for (int stop=1; stop<M; ++stop) {
        long long earliest_arrival = 0;
        long long staging_earliest_arrival = 0;
        for (int i=0; i<N; ++i) {
            int id = arrival_vec[stop-1][i].second;
            long long arrival = arrival_t[stop-1][id] + 1LL*(S[stop]-S[stop-1])*W[id];
            arrival = max(arrival, earliest_arrival);
            arrival_vec[stop][i] = {arrival, id};
            arrival_t[stop][id] = arrival;
            staging_earliest_arrival = max(arrival, staging_earliest_arrival);
            if (i < N-1 && arrival_vec[stop-1][i+1].first == arrival_vec[stop-1][i].first) continue;
            earliest_arrival = staging_earliest_arrival;
        }
        sort(arrival_vec[stop], arrival_vec[stop] + N);
    }
    // Preprocessing
    vector<pair<long long, long long>> tmap[1005];  // [stop] = {{time, earliest arrival}, ...}
    for (int stop=1; stop<M; ++stop) {
        for (auto p : arrival_vec[stop]) {
            long long arrival = p.first;
            int id = p.second;
            long long prev_from = p.first - 1LL*(S[stop]-S[stop-1])*W[id];
            tmap[stop-1].push_back({prev_from + 1, arrival});
        }
    }
    for (int stop=0; stop<M-1; ++stop) {
        sort(tmap[stop].begin(), tmap[stop].end());
        long long max_blocker = 0;
        for (int i=0; i<tmap[stop].size(); ++i) {
            const auto& p = tmap[stop][i];
            long long time = p.first;
            long long earliest_arrival = p.second;
            max_blocker = max(max_blocker, earliest_arrival);
            if (i != tmap[stop].size()-1 && tmap[stop][i].first == tmap[stop][i+1].first) continue;
            info[stop].push_back({time, max_blocker});
        }
    }
    return;
}

long long arrival_time(long long Y)
{
    for (int stop=0; stop<M-1; ++stop) {
        int l=0, r=(int)info[stop].size() - 1;
        int res = -1;
        while (l<=r)  {
            int mid = (l+r)/2;
            if (info[stop][mid].first > Y) r = mid-1;
            else {
                res = mid;
                l = mid+1;
            }
        }
        long long earliest_arrival = 0;
        if (res != -1) earliest_arrival = info[stop][res].second;
        Y = max(earliest_arrival, Y + 1LL*(S[stop+1]-S[stop])*X);
    }
    return Y;
}

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:62:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         for (int i=0; i<tmap[stop].size(); ++i) {
      |                       ~^~~~~~~~~~~~~~~~~~
overtaking.cpp:67:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |             if (i != tmap[stop].size()-1 && tmap[stop][i].first == tmap[stop][i+1].first) continue;
      |                 ~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 4 ms 6488 KB Output is correct
3 Correct 4 ms 6544 KB Output is correct
4 Correct 3 ms 6492 KB Output is correct
5 Correct 4 ms 6584 KB Output is correct
6 Correct 14 ms 19548 KB Output is correct
7 Correct 27 ms 34140 KB Output is correct
8 Correct 32 ms 39516 KB Output is correct
9 Correct 31 ms 39512 KB Output is correct
10 Correct 31 ms 39516 KB Output is correct
11 Correct 31 ms 39512 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 4 ms 6488 KB Output is correct
4 Correct 4 ms 6544 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 4 ms 6744 KB Output is correct
10 Correct 4 ms 6748 KB Output is correct
11 Correct 5 ms 6748 KB Output is correct
12 Correct 4 ms 6764 KB Output is correct
13 Correct 4 ms 6744 KB Output is correct
14 Correct 4 ms 6744 KB Output is correct
15 Correct 4 ms 6748 KB Output is correct
16 Correct 4 ms 6688 KB Output is correct
17 Correct 4 ms 6748 KB Output is correct
18 Correct 4 ms 6748 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 4 ms 6748 KB Output is correct
21 Correct 3 ms 6492 KB Output is correct
22 Correct 2 ms 3420 KB Output is correct
23 Correct 4 ms 6748 KB Output is correct
24 Correct 4 ms 6760 KB Output is correct
25 Correct 4 ms 6744 KB Output is correct
26 Correct 4 ms 7000 KB Output is correct
27 Correct 4 ms 6944 KB Output is correct
28 Correct 2 ms 3676 KB Output is correct
29 Correct 3 ms 3676 KB Output is correct
30 Correct 2 ms 3648 KB Output is correct
31 Correct 2 ms 3676 KB Output is correct
32 Correct 3 ms 6748 KB Output is correct
33 Correct 3 ms 6748 KB Output is correct
34 Correct 4 ms 6748 KB Output is correct
35 Correct 4 ms 6748 KB Output is correct
36 Correct 4 ms 6748 KB Output is correct
37 Correct 4 ms 6748 KB Output is correct
38 Correct 4 ms 6748 KB Output is correct
39 Correct 5 ms 6748 KB Output is correct
40 Correct 4 ms 6748 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 4 ms 6488 KB Output is correct
4 Correct 4 ms 6544 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 4 ms 6584 KB Output is correct
7 Correct 14 ms 19548 KB Output is correct
8 Correct 27 ms 34140 KB Output is correct
9 Correct 32 ms 39516 KB Output is correct
10 Correct 31 ms 39512 KB Output is correct
11 Correct 31 ms 39516 KB Output is correct
12 Correct 31 ms 39512 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 4 ms 6744 KB Output is correct
17 Correct 4 ms 6748 KB Output is correct
18 Correct 5 ms 6748 KB Output is correct
19 Correct 4 ms 6764 KB Output is correct
20 Correct 4 ms 6744 KB Output is correct
21 Correct 4 ms 6744 KB Output is correct
22 Correct 4 ms 6748 KB Output is correct
23 Correct 4 ms 6688 KB Output is correct
24 Correct 4 ms 6748 KB Output is correct
25 Correct 4 ms 6748 KB Output is correct
26 Correct 4 ms 6748 KB Output is correct
27 Correct 4 ms 6748 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 2 ms 3420 KB Output is correct
30 Correct 4 ms 6748 KB Output is correct
31 Correct 4 ms 6760 KB Output is correct
32 Correct 4 ms 6744 KB Output is correct
33 Correct 4 ms 7000 KB Output is correct
34 Correct 4 ms 6944 KB Output is correct
35 Correct 2 ms 3676 KB Output is correct
36 Correct 3 ms 3676 KB Output is correct
37 Correct 2 ms 3648 KB Output is correct
38 Correct 2 ms 3676 KB Output is correct
39 Correct 3 ms 6748 KB Output is correct
40 Correct 3 ms 6748 KB Output is correct
41 Correct 4 ms 6748 KB Output is correct
42 Correct 4 ms 6748 KB Output is correct
43 Correct 4 ms 6748 KB Output is correct
44 Correct 4 ms 6748 KB Output is correct
45 Correct 4 ms 6748 KB Output is correct
46 Correct 5 ms 6748 KB Output is correct
47 Correct 4 ms 6748 KB Output is correct
48 Correct 126 ms 56024 KB Output is correct
49 Correct 259 ms 56328 KB Output is correct
50 Correct 288 ms 56144 KB Output is correct
51 Correct 262 ms 56248 KB Output is correct
52 Correct 261 ms 56256 KB Output is correct
53 Correct 250 ms 56256 KB Output is correct
54 Correct 256 ms 56240 KB Output is correct
55 Correct 144 ms 54320 KB Output is correct
56 Correct 234 ms 56156 KB Output is correct
57 Correct 231 ms 56024 KB Output is correct
58 Correct 236 ms 56220 KB Output is correct
59 Correct 269 ms 56244 KB Output is correct
60 Correct 236 ms 56144 KB Output is correct
61 Correct 255 ms 56224 KB Output is correct
62 Correct 45 ms 39540 KB Output is correct
63 Correct 2 ms 2648 KB Output is correct
64 Correct 278 ms 48188 KB Output is correct
65 Correct 197 ms 31908 KB Output is correct
66 Correct 470 ms 55516 KB Output is correct
67 Correct 438 ms 56240 KB Output is correct
68 Correct 439 ms 56240 KB Output is correct
69 Correct 280 ms 56264 KB Output is correct
70 Correct 256 ms 56148 KB Output is correct
71 Correct 291 ms 56404 KB Output is correct
72 Correct 273 ms 56144 KB Output is correct
73 Correct 328 ms 56148 KB Output is correct
74 Correct 288 ms 56144 KB Output is correct
75 Correct 409 ms 55636 KB Output is correct
76 Correct 404 ms 55632 KB Output is correct
77 Correct 429 ms 55868 KB Output is correct
78 Correct 226 ms 56144 KB Output is correct

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 4 ms 6488 KB Output is correct
4 Correct 4 ms 6544 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 4 ms 6584 KB Output is correct
7 Correct 14 ms 19548 KB Output is correct
8 Correct 27 ms 34140 KB Output is correct
9 Correct 32 ms 39516 KB Output is correct
10 Correct 31 ms 39512 KB Output is correct
11 Correct 31 ms 39516 KB Output is correct
12 Correct 31 ms 39512 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 4 ms 6744 KB Output is correct
28 Correct 4 ms 6748 KB Output is correct
29 Correct 5 ms 6748 KB Output is correct
30 Correct 4 ms 6764 KB Output is correct
31 Correct 4 ms 6744 KB Output is correct
32 Correct 4 ms 6744 KB Output is correct
33 Correct 4 ms 6748 KB Output is correct
34 Correct 4 ms 6688 KB Output is correct
35 Correct 4 ms 6748 KB Output is correct
36 Correct 4 ms 6748 KB Output is correct
37 Correct 4 ms 6748 KB Output is correct
38 Correct 4 ms 6748 KB Output is correct
39 Correct 3 ms 6492 KB Output is correct
40 Correct 2 ms 3420 KB Output is correct
41 Correct 4 ms 6748 KB Output is correct
42 Correct 4 ms 6760 KB Output is correct
43 Correct 4 ms 6744 KB Output is correct
44 Correct 4 ms 7000 KB Output is correct
45 Correct 4 ms 6944 KB Output is correct
46 Correct 2 ms 3676 KB Output is correct
47 Correct 3 ms 3676 KB Output is correct
48 Correct 2 ms 3648 KB Output is correct
49 Correct 2 ms 3676 KB Output is correct
50 Correct 3 ms 6748 KB Output is correct
51 Correct 3 ms 6748 KB Output is correct
52 Correct 4 ms 6748 KB Output is correct
53 Correct 4 ms 6748 KB Output is correct
54 Correct 4 ms 6748 KB Output is correct
55 Correct 4 ms 6748 KB Output is correct
56 Correct 4 ms 6748 KB Output is correct
57 Correct 5 ms 6748 KB Output is correct
58 Correct 4 ms 6748 KB Output is correct
59 Correct 126 ms 56024 KB Output is correct
60 Correct 259 ms 56328 KB Output is correct
61 Correct 288 ms 56144 KB Output is correct
62 Correct 262 ms 56248 KB Output is correct
63 Correct 261 ms 56256 KB Output is correct
64 Correct 250 ms 56256 KB Output is correct
65 Correct 256 ms 56240 KB Output is correct
66 Correct 144 ms 54320 KB Output is correct
67 Correct 234 ms 56156 KB Output is correct
68 Correct 231 ms 56024 KB Output is correct
69 Correct 236 ms 56220 KB Output is correct
70 Correct 269 ms 56244 KB Output is correct
71 Correct 236 ms 56144 KB Output is correct
72 Correct 255 ms 56224 KB Output is correct
73 Correct 45 ms 39540 KB Output is correct
74 Correct 2 ms 2648 KB Output is correct
75 Correct 278 ms 48188 KB Output is correct
76 Correct 197 ms 31908 KB Output is correct
77 Correct 470 ms 55516 KB Output is correct
78 Correct 438 ms 56240 KB Output is correct
79 Correct 439 ms 56240 KB Output is correct
80 Correct 280 ms 56264 KB Output is correct
81 Correct 256 ms 56148 KB Output is correct
82 Correct 291 ms 56404 KB Output is correct
83 Correct 273 ms 56144 KB Output is correct
84 Correct 328 ms 56148 KB Output is correct
85 Correct 288 ms 56144 KB Output is correct
86 Correct 409 ms 55636 KB Output is correct
87 Correct 404 ms 55632 KB Output is correct
88 Correct 429 ms 55868 KB Output is correct
89 Correct 226 ms 56144 KB Output is correct
90 Execution timed out 3573 ms 56748 KB Time limit exceeded
91 Halted 0 ms 0 KB -