oj.uz

Submission #406080

# Submission time Handle Problem Language Result Execution time Memory
406080 2021-05-17T08:07:35 Z zaneyu The short shank; Redemption (BOI21_prison) C++14
35 / 100
 2000 ms 199268 KB 
/*input
5 2 5
1 9 4 6 7
*/


#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//#pragma GCC optimize("O2","unroll-loops","no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x)(int)x.size()
#define SORT_UNIQUE(c)(sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=998244353;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a<0) a+=MOD;
    if(b<0) b+=MOD;
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return(a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=5e3+5;
int dp[maxn],pv[maxn];
int cst[maxn][maxn];
int arr[maxn],b[maxn];
void calc(int l,int r,int optl,int optr){
    if(l>r) return;
    int mid=(l+r)/2;
    int op;
    dp[mid]=INF;
    for(int i=optl;i<=min(mid,optr);i++){
        if(dp[mid]>pv[i]+cst[i+1][mid]){
            dp[mid]=pv[i]+cst[i+1][mid];
            op=i;
        }
    }
    calc(l,mid-1,optl,op);
    calc(mid+1,r,op,optr);
}
int main(){
    int n,d,t;
    cin>>n>>d>>t;
    REP(i,n){
        cin>>arr[i];
    }
    REP(i,n){
        int cnt=0;
        for(int j=i;j<n;j++){
            if(j!=i) b[j]=min(arr[j],b[j-1]+1);
            else b[j]=arr[j];
            if(b[j]<=t) cnt++;
            cst[i][j]=cnt;
        }
    }
    REP(i,n) pv[i]=cst[0][i];
    int ans=INF;
    REP1(j,d){
        calc(0,n-1,0,n-1);
        REP(i,n) pv[i]=dp[i];
        MNTO(ans,dp[n-1]);
    }
    cout<<ans;
}

Compilation message

prison.cpp: In function 'void calc(int, int, int, int)':
prison.cpp:68:9: warning: 'op' may be used uninitialized in this function [-Wmaybe-uninitialized]
   68 |     calc(l,mid-1,optl,op);
      |     ~~~~^~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 388 KB Output is correct
2 Correct 2 ms 2252 KB Output is correct
3 Correct 2 ms 2252 KB Output is correct
4 Correct 3 ms 2764 KB Output is correct
5 Correct 5 ms 2764 KB Output is correct
6 Correct 3 ms 2800 KB Output is correct
7 Correct 3 ms 2764 KB Output is correct
8 Correct 3 ms 2764 KB Output is correct
9 Correct 3 ms 2764 KB Output is correct
10 Correct 3 ms 2764 KB Output is correct
11 Correct 5 ms 2764 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 2089 ms 19604 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 388 KB Output is correct
2 Correct 2 ms 2252 KB Output is correct
3 Correct 2 ms 2252 KB Output is correct
4 Correct 3 ms 2764 KB Output is correct
5 Correct 5 ms 2764 KB Output is correct
6 Correct 3 ms 2800 KB Output is correct
7 Correct 3 ms 2764 KB Output is correct
8 Correct 3 ms 2764 KB Output is correct
9 Correct 3 ms 2764 KB Output is correct
10 Correct 3 ms 2764 KB Output is correct
11 Correct 5 ms 2764 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 2252 KB Output is correct
14 Correct 3 ms 2252 KB Output is correct
15 Correct 3 ms 2764 KB Output is correct
16 Correct 4 ms 2764 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 3 ms 2764 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 3 ms 2764 KB Output is correct
21 Correct 3 ms 2764 KB Output is correct
22 Correct 4 ms 2764 KB Output is correct
23 Correct 79 ms 47636 KB Output is correct
24 Correct 100 ms 47648 KB Output is correct
25 Correct 123 ms 47828 KB Output is correct
26 Correct 143 ms 47704 KB Output is correct
27 Correct 165 ms 47688 KB Output is correct
28 Correct 70 ms 47740 KB Output is correct
29 Correct 73 ms 47684 KB Output is correct
30 Correct 87 ms 47856 KB Output is correct
31 Correct 111 ms 47708 KB Output is correct
32 Correct 132 ms 47660 KB Output is correct
33 Correct 116 ms 47712 KB Output is correct
34 Correct 67 ms 47668 KB Output is correct
35 Correct 179 ms 47812 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Runtime error 1765 ms 199268 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 388 KB Output is correct
2 Correct 2 ms 2252 KB Output is correct
3 Correct 2 ms 2252 KB Output is correct
4 Correct 3 ms 2764 KB Output is correct
5 Correct 5 ms 2764 KB Output is correct
6 Correct 3 ms 2800 KB Output is correct
7 Correct 3 ms 2764 KB Output is correct
8 Correct 3 ms 2764 KB Output is correct
9 Correct 3 ms 2764 KB Output is correct
10 Correct 3 ms 2764 KB Output is correct
11 Correct 5 ms 2764 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 2252 KB Output is correct
14 Correct 3 ms 2252 KB Output is correct
15 Correct 3 ms 2764 KB Output is correct
16 Correct 4 ms 2764 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 3 ms 2764 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 3 ms 2764 KB Output is correct
21 Correct 3 ms 2764 KB Output is correct
22 Correct 4 ms 2764 KB Output is correct
23 Correct 79 ms 47636 KB Output is correct
24 Correct 100 ms 47648 KB Output is correct
25 Correct 123 ms 47828 KB Output is correct
26 Correct 143 ms 47704 KB Output is correct
27 Correct 165 ms 47688 KB Output is correct
28 Correct 70 ms 47740 KB Output is correct
29 Correct 73 ms 47684 KB Output is correct
30 Correct 87 ms 47856 KB Output is correct
31 Correct 111 ms 47708 KB Output is correct
32 Correct 132 ms 47660 KB Output is correct
33 Correct 116 ms 47712 KB Output is correct
34 Correct 67 ms 47668 KB Output is correct
35 Correct 179 ms 47812 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Runtime error 1765 ms 199268 KB Execution killed with signal 11
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 388 KB Output is correct
2 Correct 2 ms 2252 KB Output is correct
3 Correct 2 ms 2252 KB Output is correct
4 Correct 3 ms 2764 KB Output is correct
5 Correct 5 ms 2764 KB Output is correct
6 Correct 3 ms 2800 KB Output is correct
7 Correct 3 ms 2764 KB Output is correct
8 Correct 3 ms 2764 KB Output is correct
9 Correct 3 ms 2764 KB Output is correct
10 Correct 3 ms 2764 KB Output is correct
11 Correct 5 ms 2764 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Execution timed out 2089 ms 19604 KB Time limit exceeded
14 Halted 0 ms 0 KB -