oj.uz

답안 #601371

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
601371 2022-07-21T19:03:33 Z alexander707070 The short shank; Redemption (BOI21_prison) C++14
35 / 100
 2000 ms 78072 KB 
#include<bits/stdc++.h>
#define MAXN 4007
using namespace std;

const long long inf=1e16;

int n,d;
long long t,a[MAXN];
long long cost[MAXN][MAXN],mins;

long long dp[MAXN][2];

void solve(int l,int r,int optl,int optr,int k){
    if(l>r)return;

    int mid=(l+r)/2,opt=0;
    dp[mid][k%2]=inf;
    for(int i=optl;i<=min(optr,mid);i++){
        if(dp[i-1][(k-1)%2]+cost[i][mid]<dp[mid][k%2]){
            dp[mid][k%2]=dp[i-1][(k-1)%2]+cost[i][mid];
            opt=i;
        }
    }

    solve(l,mid-1,optl,opt,k);
    solve(mid+1,r,opt,optr,k);
}

int main(){

    cin>>n>>d>>t;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }

    for(int i=1;i<=n;i++){
        mins=inf;
        for(int f=i;f<=n;f++){
            cost[i][f]=cost[i][f-1];
            if(min(a[f],f+mins)<=t)cost[i][f]++;
            mins=min(mins,a[f]-f);
        }
    }

    dp[0][0]=0;
    for(int i=1;i<=n;i++){
        dp[i][0]=inf;
    }

    for(int i=1;i<=d+1;i++){
        dp[0][i%2]=inf;
        solve(1,n,1,n,i);
    }

    cout<<dp[n][(d+1)%2]<<"\n";

    return 0;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Execution timed out 2079 ms 320 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 2 ms 2516 KB Output is correct
4 Correct 3 ms 3284 KB Output is correct
5 Correct 3 ms 3284 KB Output is correct
6 Correct 2 ms 3284 KB Output is correct
7 Correct 2 ms 3284 KB Output is correct
8 Correct 2 ms 3284 KB Output is correct
9 Correct 2 ms 3284 KB Output is correct
10 Correct 4 ms 3284 KB Output is correct
11 Correct 3 ms 3284 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 3 ms 3284 KB Output is correct
16 Correct 3 ms 3284 KB Output is correct
17 Correct 2 ms 3284 KB Output is correct
18 Correct 3 ms 3284 KB Output is correct
19 Correct 2 ms 3196 KB Output is correct
20 Correct 2 ms 3284 KB Output is correct
21 Correct 3 ms 3284 KB Output is correct
22 Correct 4 ms 3284 KB Output is correct
23 Correct 70 ms 77972 KB Output is correct
24 Correct 89 ms 77968 KB Output is correct
25 Correct 109 ms 78032 KB Output is correct
26 Correct 126 ms 78072 KB Output is correct
27 Correct 138 ms 78064 KB Output is correct
28 Correct 66 ms 78008 KB Output is correct
29 Correct 67 ms 78028 KB Output is correct
30 Correct 75 ms 78004 KB Output is correct
31 Correct 93 ms 77984 KB Output is correct
32 Correct 101 ms 77928 KB Output is correct
33 Correct 104 ms 78028 KB Output is correct
34 Correct 63 ms 77952 KB Output is correct
35 Correct 139 ms 78048 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 1243 ms 312 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 2 ms 2516 KB Output is correct
4 Correct 3 ms 3284 KB Output is correct
5 Correct 3 ms 3284 KB Output is correct
6 Correct 2 ms 3284 KB Output is correct
7 Correct 2 ms 3284 KB Output is correct
8 Correct 2 ms 3284 KB Output is correct
9 Correct 2 ms 3284 KB Output is correct
10 Correct 4 ms 3284 KB Output is correct
11 Correct 3 ms 3284 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 3 ms 3284 KB Output is correct
16 Correct 3 ms 3284 KB Output is correct
17 Correct 2 ms 3284 KB Output is correct
18 Correct 3 ms 3284 KB Output is correct
19 Correct 2 ms 3196 KB Output is correct
20 Correct 2 ms 3284 KB Output is correct
21 Correct 3 ms 3284 KB Output is correct
22 Correct 4 ms 3284 KB Output is correct
23 Correct 70 ms 77972 KB Output is correct
24 Correct 89 ms 77968 KB Output is correct
25 Correct 109 ms 78032 KB Output is correct
26 Correct 126 ms 78072 KB Output is correct
27 Correct 138 ms 78064 KB Output is correct
28 Correct 66 ms 78008 KB Output is correct
29 Correct 67 ms 78028 KB Output is correct
30 Correct 75 ms 78004 KB Output is correct
31 Correct 93 ms 77984 KB Output is correct
32 Correct 101 ms 77928 KB Output is correct
33 Correct 104 ms 78028 KB Output is correct
34 Correct 63 ms 77952 KB Output is correct
35 Correct 139 ms 78048 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Incorrect 1243 ms 312 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 2 ms 2516 KB Output is correct
4 Correct 3 ms 3284 KB Output is correct
5 Correct 3 ms 3284 KB Output is correct
6 Correct 2 ms 3284 KB Output is correct
7 Correct 2 ms 3284 KB Output is correct
8 Correct 2 ms 3284 KB Output is correct
9 Correct 2 ms 3284 KB Output is correct
10 Correct 4 ms 3284 KB Output is correct
11 Correct 3 ms 3284 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Execution timed out 2079 ms 320 KB Time limit exceeded
14 Halted 0 ms 0 KB -