답안 #867109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
867109	2023-10-27T16:59:28 Z	Ahmed_Solyman	The short shank; Redemption (BOI21_prison)	C++14	35 / 100	2000 ms	62544 KB

prison

/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
 
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
const int N=4005;
int dp[N][2];
int cost[N][N];
int n,k,t;
void solve(int l,int r,int i,int j,int g){
	if(l>r){
		return ;
	}
	int mid=l+r>>1;
	dp[mid][g]=1e9;
	int opt=i;
	for(int k=i;k<=min(j,mid);k++){
        if((k?dp[k-1][g^1]:1e9)+cost[k][mid]<dp[mid][g]){
            opt=k;
            dp[mid][g]=(k?dp[k-1][g^1]:1e9)+cost[k][mid];
        }
    }
    solve(l,mid-1,i,opt,g);
    solve(mid+1,r,opt,j,g);
}
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #ifndef ONLINE_JUDGE
    //freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
    #endif
    fast
    cin>>n>>k>>t;
    vector<int>arr(n);
    for(auto &i:arr)cin>>i;
    for(int i=0;i<n;i++){
    	stack<int>s;
    	for(int j=i;j<n;j++){
    		int x=1e9;
    		if(s.size())x=s.top();
    		s.push(min(arr[j],x+1));
    		if(i==j) cost[i][j]=(s.top()<=t);
    		else cost[i][j]=cost[i][j-1]+(s.top()<=t);
    	}
    	dp[i][0]=cost[0][i];
    }
    for(int i=1;i<=k;i++){
    	solve(0,n-1,0,n-1,i%2);
    }
    cout<<dp[n-1][k%2]<<endl;
    return 0;
}

Compilation message

prison.cpp: In function 'void solve(int, int, int, int, int)':
prison.cpp:46:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |  int mid=l+r>>1;
      |          ~^~

Subtask #1
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	2 ms	8540 KB	Output is correct
3	Correct	2 ms	8540 KB	Output is correct
4	Correct	3 ms	8540 KB	Output is correct
5	Correct	3 ms	8540 KB	Output is correct
6	Correct	2 ms	8736 KB	Output is correct
7	Correct	3 ms	8736 KB	Output is correct
8	Correct	2 ms	8536 KB	Output is correct
9	Correct	3 ms	8540 KB	Output is correct
10	Correct	3 ms	8792 KB	Output is correct
11	Correct	3 ms	8540 KB	Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	2 ms	8540 KB	Output is correct
3	Correct	2 ms	8540 KB	Output is correct
4	Correct	3 ms	8540 KB	Output is correct
5	Correct	3 ms	8540 KB	Output is correct
6	Correct	2 ms	8736 KB	Output is correct
7	Correct	3 ms	8736 KB	Output is correct
8	Correct	2 ms	8536 KB	Output is correct
9	Correct	3 ms	8540 KB	Output is correct
10	Correct	3 ms	8792 KB	Output is correct
11	Correct	3 ms	8540 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	2 ms	8652 KB	Output is correct
14	Correct	2 ms	8540 KB	Output is correct
15	Correct	3 ms	8660 KB	Output is correct
16	Correct	3 ms	8540 KB	Output is correct
17	Correct	3 ms	8540 KB	Output is correct
18	Correct	3 ms	8536 KB	Output is correct
19	Correct	3 ms	8540 KB	Output is correct
20	Correct	3 ms	8540 KB	Output is correct
21	Correct	3 ms	8656 KB	Output is correct
22	Correct	3 ms	8540 KB	Output is correct
23	Correct	109 ms	62488 KB	Output is correct
24	Correct	101 ms	62496 KB	Output is correct
25	Correct	104 ms	62544 KB	Output is correct
26	Correct	160 ms	62440 KB	Output is correct
27	Correct	141 ms	62292 KB	Output is correct
28	Correct	77 ms	62424 KB	Output is correct
29	Correct	90 ms	62476 KB	Output is correct
30	Correct	84 ms	62300 KB	Output is correct
31	Correct	96 ms	62448 KB	Output is correct
32	Correct	83 ms	62404 KB	Output is correct
33	Correct	84 ms	62424 KB	Output is correct
34	Correct	76 ms	62288 KB	Output is correct
35	Correct	123 ms	62436 KB	Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	2 ms	8540 KB	Output is correct
3	Correct	2 ms	8540 KB	Output is correct
4	Correct	3 ms	8540 KB	Output is correct
5	Correct	3 ms	8540 KB	Output is correct
6	Correct	2 ms	8736 KB	Output is correct
7	Correct	3 ms	8736 KB	Output is correct
8	Correct	2 ms	8536 KB	Output is correct
9	Correct	3 ms	8540 KB	Output is correct
10	Correct	3 ms	8792 KB	Output is correct
11	Correct	3 ms	8540 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	2 ms	8652 KB	Output is correct
14	Correct	2 ms	8540 KB	Output is correct
15	Correct	3 ms	8660 KB	Output is correct
16	Correct	3 ms	8540 KB	Output is correct
17	Correct	3 ms	8540 KB	Output is correct
18	Correct	3 ms	8536 KB	Output is correct
19	Correct	3 ms	8540 KB	Output is correct
20	Correct	3 ms	8540 KB	Output is correct
21	Correct	3 ms	8656 KB	Output is correct
22	Correct	3 ms	8540 KB	Output is correct
23	Correct	109 ms	62488 KB	Output is correct
24	Correct	101 ms	62496 KB	Output is correct
25	Correct	104 ms	62544 KB	Output is correct
26	Correct	160 ms	62440 KB	Output is correct
27	Correct	141 ms	62292 KB	Output is correct
28	Correct	77 ms	62424 KB	Output is correct
29	Correct	90 ms	62476 KB	Output is correct
30	Correct	84 ms	62300 KB	Output is correct
31	Correct	96 ms	62448 KB	Output is correct
32	Correct	83 ms	62404 KB	Output is correct
33	Correct	84 ms	62424 KB	Output is correct
34	Correct	76 ms	62288 KB	Output is correct
35	Correct	123 ms	62436 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Execution timed out	2077 ms	55008 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	2 ms	8540 KB	Output is correct
3	Correct	2 ms	8540 KB	Output is correct
4	Correct	3 ms	8540 KB	Output is correct
5	Correct	3 ms	8540 KB	Output is correct
6	Correct	2 ms	8736 KB	Output is correct
7	Correct	3 ms	8736 KB	Output is correct
8	Correct	2 ms	8536 KB	Output is correct
9	Correct	3 ms	8540 KB	Output is correct
10	Correct	3 ms	8792 KB	Output is correct
11	Correct	3 ms	8540 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Execution timed out	2082 ms	14948 KB	Time limit exceeded
14	Halted	0 ms	0 KB	-

답안 #867109

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 0 / 10.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 10.0

Subtask #5 0 / 25.0

Subtask #6 0 / 20.0

Subtask #1
15.0 / 15.0

Subtask #2
0 / 10.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 10.0

Subtask #5
0 / 25.0

Subtask #6
0 / 20.0