oj.uz

답안 #849917

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
849917 2023-09-15T14:42:06 Z MuntherCarrot 추월 (IOI23_overtaking) C++17
65 / 100
 3500 ms 31820 KB 
// by me
#include "overtaking.h"

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define all(x) x.begin(), x.end()
const int MOD = 1e9 + 7, SZ = 1e5 + 10, INF = 1e9;

vector<vector<ll>> vec, dp;
vector<int> w, s;
vector<ll> t;
int n, m, x;

void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S)
{
    n = N, m = M, w = W, s = S, t = T, x = X;
    vec.assign(M, vector<ll>(N));
    dp.assign(M, vector<ll>(N, 0));

    vector<pair<ll, int>> vv(n);
    for(int i = 0; i < n; i++){
        if(w[i] <= X) continue;
        vv[i] = {t[i], w[i]};
    }

    sort(all(vv));
    for(int i = 0; i < n; i++){
        vec[0][i] = vv[i].first;
    }

    for(int j = 1; j < m; j++){
        sort(all(vv));
        for(int i = 0; i < n; i++){
            vv[i].first += 1ll * vv[i].second * (s[j] - s[j - 1]);
            if(i){
                vv[i].first = max(vv[i].first, vv[i - 1].first);
            }
            vec[j][i] = vv[i].first;
        }
    }

    for(int j = m - 1; j >= 0; j--){
        for(int i = n - 1; i >= 0; i--){
            int _i = lower_bound(all(vec[j]), vec[j][i]) - vec[j].begin();
            if(j == m - 1 || _i == 0){
                dp[j][i] = vec[j][i] + x * (s[m - 1] - s[j]);
                continue;
            }
            dp[j][i] = dp[j + 1][_i - 1];
        }
    }
    // for(int j = 0; j < m; j++){
    //     for(int i = 0; i < n; i++){
    //         cout << vec[j][i] << ' ';
    //     }
    //     cout << endl;
    // }
    return;
}
long long arrival_time(long long Y)
{
    ll ans = Y;
    int idx = lower_bound(all(vec[0]), ans) - vec[0].begin();

    if(idx == 0){
        return 1ll * x * s[m - 1] + Y;
    }
    for(int j = 0; j < m; j++){
        ll f = 1ll * x * (s[j] - (j ? s[j - 1] : 0));
        if(idx && vec[j][idx - 1] > ans + f){
            ans = vec[j][idx - 1];
        }
        else ans += f;
        // while(idx && vec[j][idx - 1] >= ans) idx--;
        idx = lower_bound(all(vec[j]), ans) - vec[j].begin();
    }
    return ans;
}
// int32_t main(){
//     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//     int L, N, X, M, Q;
//     assert(5 == scanf("%d %d %d %d %d", &L, &N, &X, &M, &Q));
//     std::vector<long long> T(N);
//     for (int i = 0; i < N; i++)
//         assert(1 == scanf("%lld", &T[i]));
//     std::vector<int> W(N);
//     for (int i = 0; i < N; i++)
//         assert(1 == scanf("%d", &W[i]));
//     std::vector<int> S(M);
//     for (int i = 0; i < M; i++)
//         assert(1 == scanf("%d", &S[i]));
//     std::vector<long long> Y(Q);
//     for (int i = 0; i < Q; i++)
//         assert(1 == scanf("%lld", &Y[i]));
//
//     // fclose(stdin);
//
//     init(L, N, T, W, X, M, S);
//     std::vector<long long> res(Q);
//     for (int i = 0; i < Q; i++)
//         res[i] = arrival_time(Y[i]);
//
//     for (int i = 0; i < Q; i++)
//         printf("%lld\n", res[i]);
//     // fclose(stdout);
//     return 0;
// }
// by me

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 600 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 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 600 KB Output is correct
40 Correct 1 ms 760 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 600 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 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 1 ms 760 KB Output is correct
48 Correct 60 ms 16216 KB Output is correct
49 Correct 129 ms 16272 KB Output is correct
50 Correct 131 ms 16216 KB Output is correct
51 Correct 123 ms 16268 KB Output is correct
52 Correct 137 ms 16260 KB Output is correct
53 Correct 127 ms 16220 KB Output is correct
54 Correct 133 ms 16248 KB Output is correct
55 Correct 74 ms 16216 KB Output is correct
56 Correct 137 ms 16276 KB Output is correct
57 Correct 139 ms 16216 KB Output is correct
58 Correct 131 ms 16268 KB Output is correct
59 Correct 125 ms 16264 KB Output is correct
60 Correct 139 ms 16472 KB Output is correct
61 Correct 137 ms 16276 KB Output is correct
62 Correct 15 ms 600 KB Output is correct
63 Correct 2 ms 764 KB Output is correct
64 Correct 137 ms 8428 KB Output is correct
65 Correct 127 ms 8280 KB Output is correct
66 Correct 273 ms 16264 KB Output is correct
67 Correct 281 ms 16216 KB Output is correct
68 Correct 271 ms 16464 KB Output is correct
69 Correct 155 ms 16252 KB Output is correct
70 Correct 154 ms 16500 KB Output is correct
71 Correct 137 ms 16216 KB Output is correct
72 Correct 149 ms 16264 KB Output is correct
73 Correct 159 ms 16244 KB Output is correct
74 Correct 145 ms 16220 KB Output is correct
75 Correct 136 ms 16268 KB Output is correct
76 Correct 127 ms 16220 KB Output is correct
77 Correct 127 ms 16216 KB Output is correct
78 Correct 140 ms 16376 KB Output is correct

Subtask #5
0.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 600 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 348 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 1 ms 600 KB Output is correct
58 Correct 1 ms 760 KB Output is correct
59 Correct 60 ms 16216 KB Output is correct
60 Correct 129 ms 16272 KB Output is correct
61 Correct 131 ms 16216 KB Output is correct
62 Correct 123 ms 16268 KB Output is correct
63 Correct 137 ms 16260 KB Output is correct
64 Correct 127 ms 16220 KB Output is correct
65 Correct 133 ms 16248 KB Output is correct
66 Correct 74 ms 16216 KB Output is correct
67 Correct 137 ms 16276 KB Output is correct
68 Correct 139 ms 16216 KB Output is correct
69 Correct 131 ms 16268 KB Output is correct
70 Correct 125 ms 16264 KB Output is correct
71 Correct 139 ms 16472 KB Output is correct
72 Correct 137 ms 16276 KB Output is correct
73 Correct 15 ms 600 KB Output is correct
74 Correct 2 ms 764 KB Output is correct
75 Correct 137 ms 8428 KB Output is correct
76 Correct 127 ms 8280 KB Output is correct
77 Correct 273 ms 16264 KB Output is correct
78 Correct 281 ms 16216 KB Output is correct
79 Correct 271 ms 16464 KB Output is correct
80 Correct 155 ms 16252 KB Output is correct
81 Correct 154 ms 16500 KB Output is correct
82 Correct 137 ms 16216 KB Output is correct
83 Correct 149 ms 16264 KB Output is correct
84 Correct 159 ms 16244 KB Output is correct
85 Correct 145 ms 16220 KB Output is correct
86 Correct 136 ms 16268 KB Output is correct
87 Correct 127 ms 16220 KB Output is correct
88 Correct 127 ms 16216 KB Output is correct
89 Correct 140 ms 16376 KB Output is correct
90 Correct 3093 ms 18556 KB Output is correct
91 Execution timed out 3525 ms 31820 KB Time limit exceeded
92 Halted 0 ms 0 KB -