oj.uz

Submission #1034403

# Submission time Handle Problem Language Result Execution time Memory
1034403 2024-07-25T13:25:15 Z tvladm2009 Sparklers (JOI17_sparklers) C++17
50 / 100
 25 ms 1484 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 1e3 + 5;

ll n, k, t;
ll x[N];
__int128 y[N];
bool dp[N][N];

bool check(__int128 v) {
    for (int i = 1; i <= n; ++i) {
        y[i] = x[i] - 2 * v * t * i;
    }
    memset(dp, 0, sizeof(dp));
    dp[k][k] = 1;
    for (int h = 1; h <= n; ++h) {
        for (int l = 1; l + h - 1 <= n; ++l) {
            int r = l + h - 1;
            if (dp[l][r] == 0) continue;
            if (r < n && y[r + 1] <= y[l]) dp[l][r + 1] = 1;
            if (l > 1 && y[r] <= y[l - 1]) dp[l - 1][r] = 1;
        }
    }
    return dp[1][n];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k >> t;
    for (int i = 1; i <= n; ++i) cin >> x[i];

    ll l = 0, r = 1e9, sol = -1;
    while (l <= r) {
        ll m = (l + r) / 2;
        if (check(m)) {
            sol = m;
            r = m - 1;
        } else {
            l = m + 1;
        }
    }
    cout << sol << "\n";
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1460 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct
21 Correct 1 ms 1368 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1460 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct
21 Correct 1 ms 1368 KB Output is correct
22 Correct 10 ms 1372 KB Output is correct
23 Correct 7 ms 1372 KB Output is correct
24 Correct 9 ms 1480 KB Output is correct
25 Correct 13 ms 1372 KB Output is correct
26 Correct 16 ms 1368 KB Output is correct
27 Correct 17 ms 1372 KB Output is correct
28 Correct 18 ms 1368 KB Output is correct
29 Correct 18 ms 1368 KB Output is correct
30 Correct 16 ms 1372 KB Output is correct
31 Correct 17 ms 1372 KB Output is correct
32 Correct 19 ms 1240 KB Output is correct
33 Correct 25 ms 1372 KB Output is correct
34 Correct 20 ms 1372 KB Output is correct
35 Correct 20 ms 1368 KB Output is correct
36 Correct 14 ms 1372 KB Output is correct
37 Correct 14 ms 1484 KB Output is correct
38 Correct 19 ms 1372 KB Output is correct
39 Correct 14 ms 1368 KB Output is correct
40 Correct 21 ms 1372 KB Output is correct
41 Runtime error 1 ms 604 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -