QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#277060#7880. Streak ManipulationMurphy_WA 30ms13732kbC++14917b2023-12-06 15:02:592023-12-06 15:03:00

Judging History

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

  • [2023-12-06 15:03:00]
  • 评测
  • 测评结果:WA
  • 用时:30ms
  • 内存:13732kb
  • [2023-12-06 15:02:59]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
#define re register
#define il inline
#define N 200005
using namespace std;
char str[N];
int f[N][6][2],g[N],n,m,k;
bool check(int len) {
	for(int i=0;i<=n;++i) for(int j=0;j<=k;++j) f[i][j][0]=f[i][j][1]=N;
	for(int i=0,s=0;i<=n&&s<len;++i) {if(str[i+1]=='0') s=0;else s++;f[i][0][0]=0;}
	for(int i=1,x=0;i<=n;++i) {
		for(int j=1;j<=k;++j) {
			if(str[i]=='0')  f[i][j][0]=min(f[i-1][j][0],f[i-1][j][1]),x=i; 
			else if(i-len<x)  f[i][j][0]=f[x][j][0]; 
			if(i>=len) f[i][j][1]=min(f[i-len][j-1][0],f[i-len][j][1])+g[i]-g[i-len];
		}
	}
	if(f[n][k][0]<=m||f[n][k][1]<=m) return 1;
	return 0;
}

int main()
{
	cin>>n>>m>>k>>(str+1);
	for(int i=1;i<=n;++i) g[i]=g[i-1]+((str[i]-'0')^1);
	int l=0,r=n;
	while(l<r) {
		int mid=ceil((l+r)/2.0);
		if(check(mid)) l=mid;
		else r=mid-1; 
	}
	if(!l) cout<<"-1";
	else cout<<l;
	return 0;
}

详细

Test #1:

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

input:

8 3 2
10110110

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 1ms
memory: 5652kb

input:

12 3 3
100100010011

output:

2

result:

ok 1 number(s): "2"

Test #3:

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

input:

4 4 4
0000

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

score: 0
Accepted
time: 1ms
memory: 3432kb

input:

1000 200 5
0001001000101001110010011001101010110101101100010100111110111111010010001100100111100101011100011101011001110010111100100100011001010011000100011111010110100001101110101001110000001000111010000111110100111101100110011010011111000111101001010011000111010111010100101111100000100001011001010...

output:

99

result:

ok 1 number(s): "99"

Test #5:

score: 0
Accepted
time: 1ms
memory: 3668kb

input:

1000 200 5
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

40

result:

ok 1 number(s): "40"

Test #6:

score: 0
Accepted
time: 1ms
memory: 3428kb

input:

1000 200 5
1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

output:

-1

result:

ok 1 number(s): "-1"

Test #7:

score: -100
Wrong Answer
time: 30ms
memory: 13732kb

input:

200000 5 3
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

-1

result:

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