oj.uz

답안 #1029838

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029838 2024-07-21T11:54:41 Z tvladm2009 Sparklers (JOI17_sparklers) C++17
50 / 100
 69 ms 1476 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
const int N = 1e3 + 5;
 
ll n, k, t;
ll x[N];
bool dp[N][N];
 
bool check(__int128 v) {
    memset(dp, 0, sizeof(dp));
    dp[1][n] = 1;
    for (int l = 1; l <= k; ++l) {
        for (int r = n; r >= k; --r) {
            if (l == 1 && r == n) continue;  
            if (l > 1 && dp[l - 1][r] == 1 && x[r] - x[l - 1] <= 2 * v * (r - l + 1) * t) {
                dp[l][r] = 1;
            }
            if (r < n && dp[l][r + 1] == 1 && x[r + 1] - x[l] <= 2 * v * (r - l + 1) * t) {
                dp[l][r] = 1;
            }
        }
    }
    return dp[k][k];
}
 
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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1372 KB Output is correct
2 Correct 2 ms 1372 KB Output is correct
3 Correct 2 ms 1372 KB Output is correct
4 Correct 2 ms 1372 KB Output is correct
5 Correct 2 ms 1372 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 1 ms 1448 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 2 ms 1240 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 1 ms 1448 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1368 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 2 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 2 ms 1240 KB Output is correct
21 Correct 2 ms 1372 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1372 KB Output is correct
2 Correct 2 ms 1372 KB Output is correct
3 Correct 2 ms 1372 KB Output is correct
4 Correct 2 ms 1372 KB Output is correct
5 Correct 2 ms 1372 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 1 ms 1448 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 2 ms 1240 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 1 ms 1448 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1368 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 2 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 2 ms 1240 KB Output is correct
21 Correct 2 ms 1372 KB Output is correct
22 Correct 37 ms 1372 KB Output is correct
23 Correct 14 ms 1468 KB Output is correct
24 Correct 12 ms 1464 KB Output is correct
25 Correct 7 ms 1372 KB Output is correct
26 Correct 24 ms 1468 KB Output is correct
27 Correct 30 ms 1440 KB Output is correct
28 Correct 68 ms 1372 KB Output is correct
29 Correct 63 ms 1448 KB Output is correct
30 Correct 45 ms 1372 KB Output is correct
31 Correct 48 ms 1372 KB Output is correct
32 Correct 46 ms 1372 KB Output is correct
33 Correct 68 ms 1372 KB Output is correct
34 Correct 33 ms 1372 KB Output is correct
35 Correct 53 ms 1448 KB Output is correct
36 Correct 26 ms 1448 KB Output is correct
37 Correct 23 ms 1372 KB Output is correct
38 Correct 61 ms 1452 KB Output is correct
39 Correct 18 ms 1476 KB Output is correct
40 Correct 69 ms 1372 KB Output is correct

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1372 KB Output is correct
2 Correct 2 ms 1372 KB Output is correct
3 Correct 2 ms 1372 KB Output is correct
4 Correct 2 ms 1372 KB Output is correct
5 Correct 2 ms 1372 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 1 ms 1448 KB Output is correct
8 Correct 2 ms 1372 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 2 ms 1240 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 1 ms 1448 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1368 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 2 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 2 ms 1240 KB Output is correct
21 Correct 2 ms 1372 KB Output is correct
22 Correct 37 ms 1372 KB Output is correct
23 Correct 14 ms 1468 KB Output is correct
24 Correct 12 ms 1464 KB Output is correct
25 Correct 7 ms 1372 KB Output is correct
26 Correct 24 ms 1468 KB Output is correct
27 Correct 30 ms 1440 KB Output is correct
28 Correct 68 ms 1372 KB Output is correct
29 Correct 63 ms 1448 KB Output is correct
30 Correct 45 ms 1372 KB Output is correct
31 Correct 48 ms 1372 KB Output is correct
32 Correct 46 ms 1372 KB Output is correct
33 Correct 68 ms 1372 KB Output is correct
34 Correct 33 ms 1372 KB Output is correct
35 Correct 53 ms 1448 KB Output is correct
36 Correct 26 ms 1448 KB Output is correct
37 Correct 23 ms 1372 KB Output is correct
38 Correct 61 ms 1452 KB Output is correct
39 Correct 18 ms 1476 KB Output is correct
40 Correct 69 ms 1372 KB Output is correct
41 Runtime error 1 ms 604 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -