oj.uz

Submission #406079

# Submission time Handle Problem Language Result Execution time Memory
406079 2021-05-17T07:58:12 Z zaneyu The short shank; Redemption (BOI21_prison) C++14
15 / 100
 2000 ms 131548 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][maxn];
int cst[maxn][maxn];
int arr[maxn],b[maxn];
int main(){
    int n,d,t;
    cin>>n>>d>>t;
    int cnt=0;
    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){
        dp[i][0]=cst[0][i];
        REP1(j,d){
            dp[i][j]=INF;
            REP(k,i) MNTO(dp[i][j],dp[k][j-1]+cst[k+1][i]);
        }
    }
    int ans=INF;
    REP(i,d+1) MNTO(ans,dp[n-1][i]);
    cout<<ans;
}

Compilation message

prison.cpp: In function 'int main()':
prison.cpp:60:9: warning: unused variable 'cnt' [-Wunused-variable]
   60 |     int cnt=0;
      |         ^~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 5 ms 4008 KB Output is correct
3 Correct 5 ms 3916 KB Output is correct
4 Correct 13 ms 4920 KB Output is correct
5 Correct 22 ms 5020 KB Output is correct
6 Correct 4 ms 4812 KB Output is correct
7 Correct 11 ms 4852 KB Output is correct
8 Correct 5 ms 4812 KB Output is correct
9 Correct 7 ms 4812 KB Output is correct
10 Correct 13 ms 4812 KB Output is correct
11 Correct 21 ms 5012 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 2071 ms 19184 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 5 ms 4008 KB Output is correct
3 Correct 5 ms 3916 KB Output is correct
4 Correct 13 ms 4920 KB Output is correct
5 Correct 22 ms 5020 KB Output is correct
6 Correct 4 ms 4812 KB Output is correct
7 Correct 11 ms 4852 KB Output is correct
8 Correct 5 ms 4812 KB Output is correct
9 Correct 7 ms 4812 KB Output is correct
10 Correct 13 ms 4812 KB Output is correct
11 Correct 21 ms 5012 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 4 ms 3916 KB Output is correct
14 Correct 6 ms 3916 KB Output is correct
15 Correct 12 ms 4812 KB Output is correct
16 Correct 22 ms 4960 KB Output is correct
17 Correct 4 ms 4812 KB Output is correct
18 Correct 11 ms 4812 KB Output is correct
19 Correct 5 ms 4812 KB Output is correct
20 Correct 7 ms 4812 KB Output is correct
21 Correct 14 ms 4820 KB Output is correct
22 Correct 30 ms 4952 KB Output is correct
23 Execution timed out 2081 ms 54900 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 5 ms 4008 KB Output is correct
3 Correct 5 ms 3916 KB Output is correct
4 Correct 13 ms 4920 KB Output is correct
5 Correct 22 ms 5020 KB Output is correct
6 Correct 4 ms 4812 KB Output is correct
7 Correct 11 ms 4852 KB Output is correct
8 Correct 5 ms 4812 KB Output is correct
9 Correct 7 ms 4812 KB Output is correct
10 Correct 13 ms 4812 KB Output is correct
11 Correct 21 ms 5012 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 4 ms 3916 KB Output is correct
14 Correct 6 ms 3916 KB Output is correct
15 Correct 12 ms 4812 KB Output is correct
16 Correct 22 ms 4960 KB Output is correct
17 Correct 4 ms 4812 KB Output is correct
18 Correct 11 ms 4812 KB Output is correct
19 Correct 5 ms 4812 KB Output is correct
20 Correct 7 ms 4812 KB Output is correct
21 Correct 14 ms 4820 KB Output is correct
22 Correct 30 ms 4952 KB Output is correct
23 Execution timed out 2081 ms 54900 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 5 ms 4008 KB Output is correct
3 Correct 5 ms 3916 KB Output is correct
4 Correct 13 ms 4920 KB Output is correct
5 Correct 22 ms 5020 KB Output is correct
6 Correct 4 ms 4812 KB Output is correct
7 Correct 11 ms 4852 KB Output is correct
8 Correct 5 ms 4812 KB Output is correct
9 Correct 7 ms 4812 KB Output is correct
10 Correct 13 ms 4812 KB Output is correct
11 Correct 21 ms 5012 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Execution timed out 2071 ms 19184 KB Time limit exceeded
14 Halted 0 ms 0 KB -