QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#569015#7880. Streak Manipulationheige#WA 1ms6044kbC++231.2kb2024-09-16 19:54:502024-09-16 19:54:50

Judging History

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

  • [2024-09-16 19:54:50]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:6044kb
  • [2024-09-16 19:54:50]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
const int N=2e5+10,inf=1e9+10;
int n,m,k,a[N],f[N][6],g[N][6];
char c[N];
void read(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        cin>>c[i];
        a[i]=c[i]-'0';
        a[i]+=a[i-1];
    }
}
int val(int l,int r){
    return (r-l+1)-(a[r]-a[l-1]);
}
bool check(int x){
    for(int i=0;i<=n;i++) for(int j=0;j<=5;j++) f[i][j]=g[i][j]=inf;
    for(int i=0;i<=n;i++) f[i][0]=g[i][0]=0;
    for(int j=1;j<=k;j++){
        if(j==1) f[x][j]=val(1,x);
        for(int i=x+1;i<=n;i++){
            f[i][j]=g[i-x-1][j-1]+val(i-x+1,i);
            if(i!=n && c[i+1]=='0') g[i][j]=min(f[i][j],g[i-1][j]);
            else g[i][j]=g[i-1][j];
        }
    }
    return (f[n][k]<=m);
}
void work(){
    int L=1,R=n+1;
    while(L<R){
        int mid=(L+R)>>1;
        if(check(mid)) L=mid+1;
        else R=mid;
    }
    if(L==1) cout<<"-1\n";
    else cout<<L-1<<'\n';
}
int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::cout.tie(0);
    // freopen("nzq.in","r",stdin);
    // freopen("nzq.out","w",stdout);
    read();
    work();
    cerr<<1.0*clock()/CLOCKS_PER_SEC<<'\n';
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5896kb

input:

8 3 2
10110110

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 0ms
memory: 5896kb

input:

12 3 3
100100010011

output:

2

result:

ok 1 number(s): "2"

Test #3:

score: 0
Accepted
time: 0ms
memory: 6044kb

input:

4 4 4
0000

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

score: -100
Wrong Answer
time: 1ms
memory: 6000kb

input:

1000 200 5
0001001000101001110010011001101010110101101100010100111110111111010010001100100111100101011100011101011001110010111100100100011001010011000100011111010110100001101110101001110000001000111010000111110100111101100110011010011111000111101001010011000111010111010100101111100000100001011001010...

output:

96

result:

wrong answer 1st numbers differ - expected: '99', found: '96'