oj.uz

답안 #1029474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029474 2024-07-20T23:25:42 Z tvladm2009 Sparklers (JOI17_sparklers) C++17
0 / 100
 2 ms 1372 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(ll 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 = 1, r = 1e9, sol = 0;
    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
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 2 ms 1372 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 2 ms 1372 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 2 ms 1372 KB Output is correct
8 Correct 1 ms 1240 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 2 ms 1372 KB Output is correct
11 Correct 2 ms 1232 KB Output is correct
12 Correct 2 ms 1372 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 2 ms 1232 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Incorrect 1 ms 1372 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 2 ms 1372 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 2 ms 1372 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 2 ms 1372 KB Output is correct
8 Correct 1 ms 1240 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 2 ms 1372 KB Output is correct
11 Correct 2 ms 1232 KB Output is correct
12 Correct 2 ms 1372 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 2 ms 1232 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Incorrect 1 ms 1372 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 2 ms 1372 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 2 ms 1372 KB Output is correct
6 Correct 2 ms 1372 KB Output is correct
7 Correct 2 ms 1372 KB Output is correct
8 Correct 1 ms 1240 KB Output is correct
9 Correct 2 ms 1372 KB Output is correct
10 Correct 2 ms 1372 KB Output is correct
11 Correct 2 ms 1232 KB Output is correct
12 Correct 2 ms 1372 KB Output is correct
13 Correct 2 ms 1372 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 2 ms 1232 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Incorrect 1 ms 1372 KB Output isn't correct
20 Halted 0 ms 0 KB -