oj.uz

Submission #843095

# Submission time Handle Problem Language Result Execution time Memory
843095 2023-09-03T16:33:58 Z baohiep Overtaking (IOI23_overtaking) C++17
39 / 100
 3500 ms 56684 KB 
#include "overtaking.h"

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

#define MAXNM 1001000
#define MAXTIME 1000000000000000000

using namespace std;

long long L, N, M, X;
long long a;
int cars[MAXNM];
long long T[MAXNM];
long long W[MAXNM];
long long S[MAXNM];
long long currT[MAXNM];
set<pair<long long, long long>> ans[MAXNM];
vector<pair<int, long long>> mem;

bool ahead(int x, int y)
{
    return currT[x] < currT[y] || (currT[x] == currT[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;
    for (int i = 0; i < N; i++)
        cars[i] = i;
    int 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;
    N++;
}

long long arrival_time(long long Y)
{
    T[N - 1] = Y;
    W[N - 1] = X;
    for (int i = 0; i < N; i++)
    {
        cars[i] = i;
        currT[i] = T[i];
    }
    sort(cars, cars + N, ahead);
    mem.clear();

    bool found = false;
    for (int s = 1; s < M; s++)
    {
        long long d = S[s] - S[s - 1];
        long long maxTime = 0;
        for (int i = 0; i < N; i++)
        {
            int car = cars[i];
            if (car == N - 1 && maxTime >= currT[car] + W[car] * d)
            {
                auto ansIt = ans[s].lower_bound({maxTime, -1});
                if (ansIt != ans[s].end() && (*ansIt).first == maxTime)
                {
                    currT[N - 1] = (*ansIt).second;
                    found = true;
                    break;
                }
                else
                {
                    mem.push_back({s, maxTime});
                }
            }
            maxTime = max(maxTime, currT[car] + W[car] * d);
            currT[car] = maxTime;
        }
        if (found)
            break;
        sort(cars, cars + N, ahead);
    }

    for (auto it : mem)
        ans[it.first].insert({it.second, currT[N - 1]});

    return currT[N - 1];
}

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 55900 KB Output is correct
2 Correct 10 ms 55896 KB Output is correct
3 Correct 10 ms 55896 KB Output is correct
4 Correct 10 ms 55900 KB Output is correct
5 Correct 11 ms 55896 KB Output is correct
6 Correct 14 ms 55896 KB Output is correct
7 Correct 19 ms 55896 KB Output is correct
8 Correct 22 ms 55900 KB Output is correct
9 Correct 22 ms 55896 KB Output is correct
10 Correct 21 ms 55896 KB Output is correct
11 Correct 26 ms 55896 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 56156 KB Output is correct
2 Correct 11 ms 55896 KB Output is correct
3 Correct 10 ms 55900 KB Output is correct
4 Correct 13 ms 55896 KB Output is correct
5 Correct 35 ms 55896 KB Output is correct
6 Correct 73 ms 56296 KB Output is correct
7 Correct 87 ms 56032 KB Output is correct
8 Correct 85 ms 55896 KB Output is correct
9 Correct 84 ms 56032 KB Output is correct
10 Correct 86 ms 56040 KB Output is correct
11 Correct 90 ms 55896 KB Output is correct
12 Correct 85 ms 56308 KB Output is correct
13 Correct 113 ms 56048 KB Output is correct
14 Correct 109 ms 55896 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 55896 KB Output is correct
2 Correct 10 ms 55900 KB Output is correct
3 Correct 10 ms 55896 KB Output is correct
4 Correct 10 ms 55896 KB Output is correct
5 Correct 10 ms 55900 KB Output is correct
6 Correct 12 ms 56156 KB Output is correct
7 Correct 11 ms 55896 KB Output is correct
8 Correct 10 ms 55900 KB Output is correct
9 Correct 31 ms 55896 KB Output is correct
10 Correct 29 ms 55900 KB Output is correct
11 Correct 29 ms 55900 KB Output is correct
12 Correct 29 ms 55900 KB Output is correct
13 Correct 29 ms 55896 KB Output is correct
14 Correct 29 ms 55896 KB Output is correct
15 Correct 29 ms 55896 KB Output is correct
16 Correct 30 ms 55896 KB Output is correct
17 Correct 28 ms 55896 KB Output is correct
18 Correct 29 ms 55896 KB Output is correct
19 Correct 29 ms 55896 KB Output is correct
20 Correct 29 ms 55896 KB Output is correct
21 Correct 16 ms 55896 KB Output is correct
22 Correct 17 ms 55896 KB Output is correct
23 Correct 21 ms 56152 KB Output is correct
24 Correct 19 ms 55896 KB Output is correct
25 Correct 19 ms 55896 KB Output is correct
26 Correct 20 ms 55896 KB Output is correct
27 Correct 21 ms 55896 KB Output is correct
28 Correct 20 ms 55896 KB Output is correct
29 Correct 18 ms 55896 KB Output is correct
30 Correct 19 ms 56232 KB Output is correct
31 Correct 19 ms 56032 KB Output is correct
32 Correct 30 ms 55896 KB Output is correct
33 Correct 29 ms 55896 KB Output is correct
34 Correct 36 ms 55896 KB Output is correct
35 Correct 31 ms 56152 KB Output is correct
36 Correct 30 ms 55896 KB Output is correct
37 Correct 30 ms 55896 KB Output is correct
38 Correct 31 ms 55896 KB Output is correct
39 Correct 31 ms 55900 KB Output is correct
40 Correct 28 ms 55896 KB Output is correct

Subtask #4
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 55896 KB Output is correct
2 Correct 10 ms 55900 KB Output is correct
3 Correct 10 ms 55896 KB Output is correct
4 Correct 10 ms 55896 KB Output is correct
5 Correct 10 ms 55900 KB Output is correct
6 Correct 11 ms 55896 KB Output is correct
7 Correct 14 ms 55896 KB Output is correct
8 Correct 19 ms 55896 KB Output is correct
9 Correct 22 ms 55900 KB Output is correct
10 Correct 22 ms 55896 KB Output is correct
11 Correct 21 ms 55896 KB Output is correct
12 Correct 26 ms 55896 KB Output is correct
13 Correct 12 ms 56156 KB Output is correct
14 Correct 11 ms 55896 KB Output is correct
15 Correct 10 ms 55900 KB Output is correct
16 Correct 31 ms 55896 KB Output is correct
17 Correct 29 ms 55900 KB Output is correct
18 Correct 29 ms 55900 KB Output is correct
19 Correct 29 ms 55900 KB Output is correct
20 Correct 29 ms 55896 KB Output is correct
21 Correct 29 ms 55896 KB Output is correct
22 Correct 29 ms 55896 KB Output is correct
23 Correct 30 ms 55896 KB Output is correct
24 Correct 28 ms 55896 KB Output is correct
25 Correct 29 ms 55896 KB Output is correct
26 Correct 29 ms 55896 KB Output is correct
27 Correct 29 ms 55896 KB Output is correct
28 Correct 16 ms 55896 KB Output is correct
29 Correct 17 ms 55896 KB Output is correct
30 Correct 21 ms 56152 KB Output is correct
31 Correct 19 ms 55896 KB Output is correct
32 Correct 19 ms 55896 KB Output is correct
33 Correct 20 ms 55896 KB Output is correct
34 Correct 21 ms 55896 KB Output is correct
35 Correct 20 ms 55896 KB Output is correct
36 Correct 18 ms 55896 KB Output is correct
37 Correct 19 ms 56232 KB Output is correct
38 Correct 19 ms 56032 KB Output is correct
39 Correct 30 ms 55896 KB Output is correct
40 Correct 29 ms 55896 KB Output is correct
41 Correct 36 ms 55896 KB Output is correct
42 Correct 31 ms 56152 KB Output is correct
43 Correct 30 ms 55896 KB Output is correct
44 Correct 30 ms 55896 KB Output is correct
45 Correct 31 ms 55896 KB Output is correct
46 Correct 31 ms 55900 KB Output is correct
47 Correct 28 ms 55896 KB Output is correct
48 Execution timed out 3527 ms 56684 KB Time limit exceeded
49 Halted 0 ms 0 KB -

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 55896 KB Output is correct
2 Correct 10 ms 55900 KB Output is correct
3 Correct 10 ms 55896 KB Output is correct
4 Correct 10 ms 55896 KB Output is correct
5 Correct 10 ms 55900 KB Output is correct
6 Correct 11 ms 55896 KB Output is correct
7 Correct 14 ms 55896 KB Output is correct
8 Correct 19 ms 55896 KB Output is correct
9 Correct 22 ms 55900 KB Output is correct
10 Correct 22 ms 55896 KB Output is correct
11 Correct 21 ms 55896 KB Output is correct
12 Correct 26 ms 55896 KB Output is correct
13 Correct 12 ms 56156 KB Output is correct
14 Correct 11 ms 55896 KB Output is correct
15 Correct 10 ms 55900 KB Output is correct
16 Correct 13 ms 55896 KB Output is correct
17 Correct 35 ms 55896 KB Output is correct
18 Correct 73 ms 56296 KB Output is correct
19 Correct 87 ms 56032 KB Output is correct
20 Correct 85 ms 55896 KB Output is correct
21 Correct 84 ms 56032 KB Output is correct
22 Correct 86 ms 56040 KB Output is correct
23 Correct 90 ms 55896 KB Output is correct
24 Correct 85 ms 56308 KB Output is correct
25 Correct 113 ms 56048 KB Output is correct
26 Correct 109 ms 55896 KB Output is correct
27 Correct 31 ms 55896 KB Output is correct
28 Correct 29 ms 55900 KB Output is correct
29 Correct 29 ms 55900 KB Output is correct
30 Correct 29 ms 55900 KB Output is correct
31 Correct 29 ms 55896 KB Output is correct
32 Correct 29 ms 55896 KB Output is correct
33 Correct 29 ms 55896 KB Output is correct
34 Correct 30 ms 55896 KB Output is correct
35 Correct 28 ms 55896 KB Output is correct
36 Correct 29 ms 55896 KB Output is correct
37 Correct 29 ms 55896 KB Output is correct
38 Correct 29 ms 55896 KB Output is correct
39 Correct 16 ms 55896 KB Output is correct
40 Correct 17 ms 55896 KB Output is correct
41 Correct 21 ms 56152 KB Output is correct
42 Correct 19 ms 55896 KB Output is correct
43 Correct 19 ms 55896 KB Output is correct
44 Correct 20 ms 55896 KB Output is correct
45 Correct 21 ms 55896 KB Output is correct
46 Correct 20 ms 55896 KB Output is correct
47 Correct 18 ms 55896 KB Output is correct
48 Correct 19 ms 56232 KB Output is correct
49 Correct 19 ms 56032 KB Output is correct
50 Correct 30 ms 55896 KB Output is correct
51 Correct 29 ms 55896 KB Output is correct
52 Correct 36 ms 55896 KB Output is correct
53 Correct 31 ms 56152 KB Output is correct
54 Correct 30 ms 55896 KB Output is correct
55 Correct 30 ms 55896 KB Output is correct
56 Correct 31 ms 55896 KB Output is correct
57 Correct 31 ms 55900 KB Output is correct
58 Correct 28 ms 55896 KB Output is correct
59 Execution timed out 3527 ms 56684 KB Time limit exceeded
60 Halted 0 ms 0 KB -