oj.uz

답안 #1057952

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057952 2024-08-14T07:35:55 Z shmax 추월 (IOI23_overtaking) C++17
65 / 100
 3500 ms 49488 KB 
#include "overtaking.h"
#include <bits/stdc++.h>

using namespace std;
using i32 = int;
#define int long long
#define len(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define inf 1000'000'000'000'000'000LL


template<typename T>
using vec = vector<T>;


template<typename T>
using graph = vec<vec<T>>;

namespace Params {
    int L, N;
    vec<int> T, W;
    int X, M;
    vec<int> S;
}

vec<vec<int>> e;
vec<vec<pair<int, int>>> te;

void init(i32 L, i32 N, std::vector<int> T, std::vector<i32> W, i32 X, i32 M, std::vector<i32> S) {
    Params::L = L;
    Params::N = N;
    Params::T = T;
    Params::W.resize(N);
    for (int i = 0; i < N; i++) {
        Params::W[i] = W[i];
    }
    Params::X = X;
    Params::M = M;
    Params::S.resize(M);
    for (int i = 0; i < M; i++) {
        Params::S[i] = S[i];
    }
    e.resize(N, vec<int>(M, 0));
    te.resize(M);
    for (int i = 0; i < N; i++) {
        e[i][0] = T[i];
    }

    for (int j = 1; j < M; j++) {
        vec<int> ord(N);
        iota(all(ord), 0);
        sort(all(ord), [&](int x, int y) {
            return e[x][j - 1] < e[y][j - 1];
        });
        int before = 0;
        int cur = 0;
        for (int k = 0; k < len(ord); k++) {
            int i = ord[k];
            if (k != 0) {
                if (e[i][j - 1] != e[ord[k - 1]][j - 1]) {
                    before = max(before, cur);
                    cur = 0;
                }
            }
            e[i][j] = max(e[i][j - 1] + (Params::S[j] - Params::S[j - 1]) * Params::W[i], before);
            cur = max(cur, e[i][j]);
        }
        for (int i = 0; i < N; i++) {
            te[j - 1].emplace_back(e[i][j - 1], e[i][j]);
        }
        sort(all(te[j - 1]));
        for (int i = 1; i < N; i++) {
            te[j - 1][i].second = max(te[j - 1][i].second, te[j - 1][i - 1].second);
        }

    }
}

int arrival_time(int Y) {
    int cur_time = Y;
    for (int j = 1; j < Params::M; j++) {
        int time = 0;
//        for (int i = 0; i < Params::N; i++) {
//            if (e[i][j - 1] < cur_time)
//                time = max(time, e[i][j]);
//        }
        int tl = 0;
        int tr = len(te[j - 1]) - 1;
        while (tl != tr) {
            int tm = (tl + tr + 1) / 2;
            if (te[j - 1][tm].first < cur_time) {
                tl = tm;
            } else {
                tr = tm - 1;
            }
        }
        if (te[j - 1][tl].first < cur_time) {
            time = te[j - 1][tl].second;
        }
        time = max(time, cur_time + (Params::S[j] - Params::S[j - 1]) * Params::X);
        cur_time = time;
    }
    return cur_time;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 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 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
5 Correct 0 ms 344 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 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 604 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 0 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 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 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 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 0 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 0 ms 604 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 1 ms 600 KB Output is correct
37 Correct 0 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 600 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 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 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 604 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 0 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 348 KB Output is correct
29 Correct 1 ms 348 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 0 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 0 ms 604 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 1 ms 600 KB Output is correct
43 Correct 1 ms 600 KB Output is correct
44 Correct 0 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 600 KB Output is correct
48 Correct 87 ms 24404 KB Output is correct
49 Correct 148 ms 24404 KB Output is correct
50 Correct 141 ms 24656 KB Output is correct
51 Correct 159 ms 24404 KB Output is correct
52 Correct 146 ms 24404 KB Output is correct
53 Correct 144 ms 24404 KB Output is correct
54 Correct 156 ms 24404 KB Output is correct
55 Correct 105 ms 24424 KB Output is correct
56 Correct 145 ms 24496 KB Output is correct
57 Correct 141 ms 24400 KB Output is correct
58 Correct 161 ms 24400 KB Output is correct
59 Correct 171 ms 24400 KB Output is correct
60 Correct 141 ms 24408 KB Output is correct
61 Correct 144 ms 24552 KB Output is correct
62 Correct 8 ms 600 KB Output is correct
63 Correct 2 ms 604 KB Output is correct
64 Correct 136 ms 12572 KB Output is correct
65 Correct 149 ms 12408 KB Output is correct
66 Correct 280 ms 24588 KB Output is correct
67 Correct 277 ms 24604 KB Output is correct
68 Correct 253 ms 24616 KB Output is correct
69 Correct 151 ms 24400 KB Output is correct
70 Correct 146 ms 24400 KB Output is correct
71 Correct 153 ms 24440 KB Output is correct
72 Correct 152 ms 24560 KB Output is correct
73 Correct 148 ms 24404 KB Output is correct
74 Correct 161 ms 24556 KB Output is correct
75 Correct 226 ms 24400 KB Output is correct
76 Correct 227 ms 24364 KB Output is correct
77 Correct 217 ms 24580 KB Output is correct
78 Correct 152 ms 24420 KB Output is correct

Subtask #5
0.0 / 35.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 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 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 0 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 0 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 604 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 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 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 0 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 0 ms 604 KB Output is correct
52 Correct 1 ms 600 KB Output is correct
53 Correct 1 ms 600 KB Output is correct
54 Correct 1 ms 600 KB Output is correct
55 Correct 0 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 1 ms 600 KB Output is correct
59 Correct 87 ms 24404 KB Output is correct
60 Correct 148 ms 24404 KB Output is correct
61 Correct 141 ms 24656 KB Output is correct
62 Correct 159 ms 24404 KB Output is correct
63 Correct 146 ms 24404 KB Output is correct
64 Correct 144 ms 24404 KB Output is correct
65 Correct 156 ms 24404 KB Output is correct
66 Correct 105 ms 24424 KB Output is correct
67 Correct 145 ms 24496 KB Output is correct
68 Correct 141 ms 24400 KB Output is correct
69 Correct 161 ms 24400 KB Output is correct
70 Correct 171 ms 24400 KB Output is correct
71 Correct 141 ms 24408 KB Output is correct
72 Correct 144 ms 24552 KB Output is correct
73 Correct 8 ms 600 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 136 ms 12572 KB Output is correct
76 Correct 149 ms 12408 KB Output is correct
77 Correct 280 ms 24588 KB Output is correct
78 Correct 277 ms 24604 KB Output is correct
79 Correct 253 ms 24616 KB Output is correct
80 Correct 151 ms 24400 KB Output is correct
81 Correct 146 ms 24400 KB Output is correct
82 Correct 153 ms 24440 KB Output is correct
83 Correct 152 ms 24560 KB Output is correct
84 Correct 148 ms 24404 KB Output is correct
85 Correct 161 ms 24556 KB Output is correct
86 Correct 226 ms 24400 KB Output is correct
87 Correct 227 ms 24364 KB Output is correct
88 Correct 217 ms 24580 KB Output is correct
89 Correct 152 ms 24420 KB Output is correct
90 Correct 2515 ms 27488 KB Output is correct
91 Execution timed out 3527 ms 49488 KB Time limit exceeded
92 Halted 0 ms 0 KB -