oj.uz

Submission #892783

# Submission time Handle Problem Language Result Execution time Memory
892783 2023-12-26T00:03:53 Z Benmath Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 129120 KB 
#include "overtaking.h"

#include <vector>
#include <algorithm>
#include <iostream>
#include <set>

#define MAXNM 1001000
#define MAXTIME 1000000000000000000

using namespace std;

long long L, N, M, X, Y, id, station;
long long a;
long long T[MAXNM];
long long W[MAXNM];
long long S[MAXNM];
vector<long long> currT[MAXNM];
vector<int> cars[MAXNM];
set<pair<int, int>> overtake[MAXNM];

bool ahead(int x, int y)
{
    return currT[id][x] < currT[id][y] || (currT[id][x] == currT[id][y] && W[x] < W[y]);
}

void init(int LL, int NN, std::vector<long long> TT, std::vector<int> WW, int XX, int MM, std::vector<int> SS)
{
    L = LL;
    N = NN;
    M = MM;
    X = XX;
    id = 0;
    for (long long i : TT)
        T[id++] = i;
    id = 0;
    for (int i : WW)
        W[id++] = i;
    id = 0;
    for (int i : SS)
    {
        S[id++] = i;
    }

    id = 0;
    for (int i = 0; i < N; i++)
    {
        if (W[i] > X)
        {
            W[id] = W[i];
            T[id] = T[i];
            id++;
        }
    }
    N = id;

    for (int s = 0; s < M; s++)
    {
        currT[s] = vector<long long>(N);
        cars[s] = vector<int>(N);
        for (int i = 0; i < N; i++)
            cars[s][i] = i;
    }

    for (int i = 0; i < N; i++)
    {
        currT[0][i] = T[i];
    }
    id = 0;
    std::sort(cars[0].begin(), cars[0].end(), ahead);

    for (int s = 1; s < M; s++)
    {
        long long d = S[s] - S[s - 1];
        long long maxTime = 0, maxCar = -1;
        for (int i = 0; i < N; i++)
        {
            int car = cars[s - 1][i];
            if (maxTime < currT[s - 1][car] + W[car] * d)
            {
                maxTime = currT[s - 1][car] + W[car] * d;
                maxCar = car;
            }
            else
            {
                overtake[car].insert({s, maxCar});
            }
            currT[s][car] = maxTime;
        }
        id = s;
        std::sort(cars[s].begin(), cars[s].end(), ahead);
    }

    for (int i = 0; i < N; i++)
        overtake[i].insert({M, -1});
}

int vertBin(int s, int x, int y)
{
    if (Y <= currT[s][cars[s][0]])
        return -1;

    if (x == y)
        return cars[s][x];

    int half = (x + y + 1) / 2;
    if (currT[s][cars[s][half]] < Y)
        return vertBin(s, half, y);
    return vertBin(s, x, half - 1);
}

int horBin(int carId, int x, int y)
{
    if (x == y)
        return x;

    int half = (x + y) / 2;
    if (Y + X * (S[half] - S[station]) > currT[half][carId])
        return horBin(carId, half + 1, y);
    return horBin(carId, x, half);
}

long long arrival_time(long long YY)
{
    Y = YY;

    if (N == 0)
        return Y + L * X;

    station = 0;
    int below = vertBin(0, 0, N - 1);
    while (station != M - 1)
    {
        if (below == -1)
            return Y + X * (L - S[station]);

        auto it = overtake[below].lower_bound({station + 1, -1});
        int pos = (*it).first;

        int st = pos - 1;
        if (Y + (S[st] - S[station]) * X > currT[st][below])
        {
            Y += (S[st] - S[station]) * X;
            below = (*it).second;
            station = st;
        }
        else
        {
            int ost = horBin(below, station, st);
            Y = currT[ost][below];
            station = ost;
            below = vertBin(station, 0, N - 1);
        }
    }

    return Y;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 98908 KB Output is correct
2 Correct 20 ms 99076 KB Output is correct
3 Correct 20 ms 98904 KB Output is correct
4 Correct 20 ms 98908 KB Output is correct
5 Correct 20 ms 98908 KB Output is correct
6 Correct 21 ms 99164 KB Output is correct
7 Correct 20 ms 99084 KB Output is correct
8 Correct 21 ms 99164 KB Output is correct
9 Correct 20 ms 99096 KB Output is correct
10 Correct 21 ms 99160 KB Output is correct
11 Correct 20 ms 99088 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 99160 KB Output is correct
2 Correct 20 ms 98904 KB Output is correct
3 Correct 19 ms 98904 KB Output is correct
4 Correct 20 ms 98908 KB Output is correct
5 Correct 20 ms 99164 KB Output is correct
6 Correct 21 ms 99164 KB Output is correct
7 Correct 21 ms 99036 KB Output is correct
8 Correct 21 ms 99164 KB Output is correct
9 Correct 21 ms 99164 KB Output is correct
10 Correct 21 ms 99164 KB Output is correct
11 Correct 21 ms 99016 KB Output is correct
12 Correct 21 ms 99164 KB Output is correct
13 Correct 23 ms 99164 KB Output is correct
14 Correct 21 ms 99164 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 99020 KB Output is correct
2 Correct 20 ms 98908 KB Output is correct
3 Correct 20 ms 99076 KB Output is correct
4 Correct 20 ms 98904 KB Output is correct
5 Correct 20 ms 98908 KB Output is correct
6 Correct 21 ms 99160 KB Output is correct
7 Correct 20 ms 98904 KB Output is correct
8 Correct 19 ms 98904 KB Output is correct
9 Correct 20 ms 99160 KB Output is correct
10 Correct 23 ms 99160 KB Output is correct
11 Correct 21 ms 99164 KB Output is correct
12 Correct 21 ms 99164 KB Output is correct
13 Correct 20 ms 99164 KB Output is correct
14 Correct 20 ms 99040 KB Output is correct
15 Correct 21 ms 99164 KB Output is correct
16 Correct 21 ms 99164 KB Output is correct
17 Correct 21 ms 99156 KB Output is correct
18 Correct 21 ms 99160 KB Output is correct
19 Correct 21 ms 99164 KB Output is correct
20 Correct 20 ms 99244 KB Output is correct
21 Correct 22 ms 99164 KB Output is correct
22 Correct 21 ms 99164 KB Output is correct
23 Correct 21 ms 99164 KB Output is correct
24 Correct 21 ms 99164 KB Output is correct
25 Correct 22 ms 99164 KB Output is correct
26 Correct 21 ms 99100 KB Output is correct
27 Correct 21 ms 99040 KB Output is correct
28 Correct 22 ms 99012 KB Output is correct
29 Correct 21 ms 99164 KB Output is correct
30 Correct 21 ms 99160 KB Output is correct
31 Correct 23 ms 99164 KB Output is correct
32 Correct 20 ms 99164 KB Output is correct
33 Correct 20 ms 99160 KB Output is correct
34 Correct 21 ms 99164 KB Output is correct
35 Correct 20 ms 99164 KB Output is correct
36 Correct 20 ms 99164 KB Output is correct
37 Correct 21 ms 99036 KB Output is correct
38 Correct 22 ms 99068 KB Output is correct
39 Correct 20 ms 98908 KB Output is correct
40 Correct 21 ms 99072 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 99020 KB Output is correct
2 Correct 20 ms 98908 KB Output is correct
3 Correct 20 ms 99076 KB Output is correct
4 Correct 20 ms 98904 KB Output is correct
5 Correct 20 ms 98908 KB Output is correct
6 Correct 20 ms 98908 KB Output is correct
7 Correct 21 ms 99164 KB Output is correct
8 Correct 20 ms 99084 KB Output is correct
9 Correct 21 ms 99164 KB Output is correct
10 Correct 20 ms 99096 KB Output is correct
11 Correct 21 ms 99160 KB Output is correct
12 Correct 20 ms 99088 KB Output is correct
13 Correct 21 ms 99160 KB Output is correct
14 Correct 20 ms 98904 KB Output is correct
15 Correct 19 ms 98904 KB Output is correct
16 Correct 20 ms 99160 KB Output is correct
17 Correct 23 ms 99160 KB Output is correct
18 Correct 21 ms 99164 KB Output is correct
19 Correct 21 ms 99164 KB Output is correct
20 Correct 20 ms 99164 KB Output is correct
21 Correct 20 ms 99040 KB Output is correct
22 Correct 21 ms 99164 KB Output is correct
23 Correct 21 ms 99164 KB Output is correct
24 Correct 21 ms 99156 KB Output is correct
25 Correct 21 ms 99160 KB Output is correct
26 Correct 21 ms 99164 KB Output is correct
27 Correct 20 ms 99244 KB Output is correct
28 Correct 22 ms 99164 KB Output is correct
29 Correct 21 ms 99164 KB Output is correct
30 Correct 21 ms 99164 KB Output is correct
31 Correct 21 ms 99164 KB Output is correct
32 Correct 22 ms 99164 KB Output is correct
33 Correct 21 ms 99100 KB Output is correct
34 Correct 21 ms 99040 KB Output is correct
35 Correct 22 ms 99012 KB Output is correct
36 Correct 21 ms 99164 KB Output is correct
37 Correct 21 ms 99160 KB Output is correct
38 Correct 23 ms 99164 KB Output is correct
39 Correct 20 ms 99164 KB Output is correct
40 Correct 20 ms 99160 KB Output is correct
41 Correct 21 ms 99164 KB Output is correct
42 Correct 20 ms 99164 KB Output is correct
43 Correct 20 ms 99164 KB Output is correct
44 Correct 21 ms 99036 KB Output is correct
45 Correct 22 ms 99068 KB Output is correct
46 Correct 20 ms 98908 KB Output is correct
47 Correct 21 ms 99072 KB Output is correct
48 Correct 122 ms 113096 KB Output is correct
49 Correct 123 ms 113132 KB Output is correct
50 Correct 111 ms 111968 KB Output is correct
51 Correct 123 ms 113252 KB Output is correct
52 Correct 126 ms 112980 KB Output is correct
53 Correct 122 ms 113148 KB Output is correct
54 Correct 142 ms 113052 KB Output is correct
55 Correct 328 ms 129120 KB Output is correct
56 Correct 155 ms 113388 KB Output is correct
57 Correct 164 ms 116168 KB Output is correct
58 Correct 147 ms 112724 KB Output is correct
59 Correct 158 ms 113252 KB Output is correct
60 Correct 156 ms 113232 KB Output is correct
61 Correct 149 ms 112720 KB Output is correct
62 Correct 25 ms 99280 KB Output is correct
63 Correct 22 ms 99420 KB Output is correct
64 Correct 314 ms 106688 KB Output is correct
65 Correct 275 ms 107088 KB Output is correct
66 Correct 717 ms 115484 KB Output is correct
67 Correct 645 ms 114612 KB Output is correct
68 Correct 626 ms 114804 KB Output is correct
69 Correct 93 ms 111188 KB Output is correct
70 Correct 85 ms 110984 KB Output is correct
71 Correct 86 ms 111056 KB Output is correct
72 Correct 89 ms 111132 KB Output is correct
73 Correct 88 ms 110936 KB Output is correct
74 Correct 85 ms 111020 KB Output is correct
75 Correct 21 ms 99288 KB Output is correct
76 Correct 21 ms 99160 KB Output is correct
77 Correct 21 ms 99152 KB Output is correct
78 Correct 91 ms 110876 KB Output is correct

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 99020 KB Output is correct
2 Correct 20 ms 98908 KB Output is correct
3 Correct 20 ms 99076 KB Output is correct
4 Correct 20 ms 98904 KB Output is correct
5 Correct 20 ms 98908 KB Output is correct
6 Correct 20 ms 98908 KB Output is correct
7 Correct 21 ms 99164 KB Output is correct
8 Correct 20 ms 99084 KB Output is correct
9 Correct 21 ms 99164 KB Output is correct
10 Correct 20 ms 99096 KB Output is correct
11 Correct 21 ms 99160 KB Output is correct
12 Correct 20 ms 99088 KB Output is correct
13 Correct 21 ms 99160 KB Output is correct
14 Correct 20 ms 98904 KB Output is correct
15 Correct 19 ms 98904 KB Output is correct
16 Correct 20 ms 98908 KB Output is correct
17 Correct 20 ms 99164 KB Output is correct
18 Correct 21 ms 99164 KB Output is correct
19 Correct 21 ms 99036 KB Output is correct
20 Correct 21 ms 99164 KB Output is correct
21 Correct 21 ms 99164 KB Output is correct
22 Correct 21 ms 99164 KB Output is correct
23 Correct 21 ms 99016 KB Output is correct
24 Correct 21 ms 99164 KB Output is correct
25 Correct 23 ms 99164 KB Output is correct
26 Correct 21 ms 99164 KB Output is correct
27 Correct 20 ms 99160 KB Output is correct
28 Correct 23 ms 99160 KB Output is correct
29 Correct 21 ms 99164 KB Output is correct
30 Correct 21 ms 99164 KB Output is correct
31 Correct 20 ms 99164 KB Output is correct
32 Correct 20 ms 99040 KB Output is correct
33 Correct 21 ms 99164 KB Output is correct
34 Correct 21 ms 99164 KB Output is correct
35 Correct 21 ms 99156 KB Output is correct
36 Correct 21 ms 99160 KB Output is correct
37 Correct 21 ms 99164 KB Output is correct
38 Correct 20 ms 99244 KB Output is correct
39 Correct 22 ms 99164 KB Output is correct
40 Correct 21 ms 99164 KB Output is correct
41 Correct 21 ms 99164 KB Output is correct
42 Correct 21 ms 99164 KB Output is correct
43 Correct 22 ms 99164 KB Output is correct
44 Correct 21 ms 99100 KB Output is correct
45 Correct 21 ms 99040 KB Output is correct
46 Correct 22 ms 99012 KB Output is correct
47 Correct 21 ms 99164 KB Output is correct
48 Correct 21 ms 99160 KB Output is correct
49 Correct 23 ms 99164 KB Output is correct
50 Correct 20 ms 99164 KB Output is correct
51 Correct 20 ms 99160 KB Output is correct
52 Correct 21 ms 99164 KB Output is correct
53 Correct 20 ms 99164 KB Output is correct
54 Correct 20 ms 99164 KB Output is correct
55 Correct 21 ms 99036 KB Output is correct
56 Correct 22 ms 99068 KB Output is correct
57 Correct 20 ms 98908 KB Output is correct
58 Correct 21 ms 99072 KB Output is correct
59 Correct 122 ms 113096 KB Output is correct
60 Correct 123 ms 113132 KB Output is correct
61 Correct 111 ms 111968 KB Output is correct
62 Correct 123 ms 113252 KB Output is correct
63 Correct 126 ms 112980 KB Output is correct
64 Correct 122 ms 113148 KB Output is correct
65 Correct 142 ms 113052 KB Output is correct
66 Correct 328 ms 129120 KB Output is correct
67 Correct 155 ms 113388 KB Output is correct
68 Correct 164 ms 116168 KB Output is correct
69 Correct 147 ms 112724 KB Output is correct
70 Correct 158 ms 113252 KB Output is correct
71 Correct 156 ms 113232 KB Output is correct
72 Correct 149 ms 112720 KB Output is correct
73 Correct 25 ms 99280 KB Output is correct
74 Correct 22 ms 99420 KB Output is correct
75 Correct 314 ms 106688 KB Output is correct
76 Correct 275 ms 107088 KB Output is correct
77 Correct 717 ms 115484 KB Output is correct
78 Correct 645 ms 114612 KB Output is correct
79 Correct 626 ms 114804 KB Output is correct
80 Correct 93 ms 111188 KB Output is correct
81 Correct 85 ms 110984 KB Output is correct
82 Correct 86 ms 111056 KB Output is correct
83 Correct 89 ms 111132 KB Output is correct
84 Correct 88 ms 110936 KB Output is correct
85 Correct 85 ms 111020 KB Output is correct
86 Correct 21 ms 99288 KB Output is correct
87 Correct 21 ms 99160 KB Output is correct
88 Correct 21 ms 99152 KB Output is correct
89 Correct 91 ms 110876 KB Output is correct
90 Execution timed out 3547 ms 116244 KB Time limit exceeded
91 Halted 0 ms 0 KB -