QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#277334#7880. Streak ManipulationfunnufRE 8ms26940kbC++141.1kb2023-12-06 17:50:462023-12-06 17:50:47

Judging History

你现在查看的是最新测评结果

  • [2023-12-06 17:50:47]
  • 评测
  • 测评结果:RE
  • 用时:8ms
  • 内存:26940kb
  • [2023-12-06 17:50:46]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
// #define int long long
const int N = 3e5 + 5; 

int ans=0;
int n,m,k;
int pre[N];
int dp[N][10][2];
int val(int l,int r){
    return r-l+1-(pre[r]-pre[l-1]);
}


bool check(ll x){
    memset(dp,63,sizeof dp);
    dp[0][0][0]=0;
    for(int i=1;i<=n;++i){
        for(int j=1;j<=k;++j){
            dp[i][j][1]=dp[i-x][j-1][0]+val(i-x+1,i);
            dp[i][j][0]=min(dp[i-x][j][0],dp[i-x][j][1]);
        }
    }
    // cout<<dp[n][k][1]<<' '<< dp[n][k][0];
    if(dp[n][k][1]<=m||dp[n][k][0]<=m)return 1;
    return 0;
}

void solve() {
	cin>>n>>m>>k;
    string s;cin>>s;
    for(int i=1;i<=n;++i){
        pre[i]=pre[i-1]+s[i-1]-'0';
    }
    ans=-1;
    int l=0,r=n;
    while(l<=r){
        int mid=l+r>>1;
        if(check(mid)){
            ans=mid;
            l=mid+1;
        }
        else {
            r=mid-1;
        }
    }
    cout<<ans;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
	solve();
	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 2ms
memory: 26940kb

input:

8 3 2
10110110

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 8ms
memory: 26880kb

input:

12 3 3
100100010011

output:

2

result:

ok 1 number(s): "2"

Test #3:

score: 0
Accepted
time: 3ms
memory: 26936kb

input:

4 4 4
0000

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

score: -100
Runtime Error

input:

1000 200 5
0001001000101001110010011001101010110101101100010100111110111111010010001100100111100101011100011101011001110010111100100100011001010011000100011111010110100001101110101001110000001000111010000111110100111101100110011010011111000111101001010011000111010111010100101111100000100001011001010...

output:


result: