QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#549267#9229. Juliet Unifies Onesknightofshadow#WA 0ms3548kbC++14576b2024-09-06 13:39:502024-09-06 13:39:52

Judging History

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

  • [2024-09-06 13:39:52]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3548kb
  • [2024-09-06 13:39:50]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[100]={0};
ll ans[100][3]={0};
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	string s;
	cin>>s;
	s='-'+s;
	vector<pair<ll,ll>>a;
	ll i=1,cnt=0,ed=0,f=1;
	while(s[i]!='1'&&i<=s.size()-1) i++;
	for(;i<=s.size()-1;i++){
		if(s[i]=='1'){
			ans[i][0]=min(ans[i-1][0]+1,ans[i-1][1]);
			ans[i][1]=ans[i-1][1];
		}
		else{
			ans[i][0]=min(ans[i-1][1],ans[i-1][0]);
			ans[i][1]=ans[i-1][1]+1;
		}
	}
	cout<<min(ans[s.size()-1][0],ans[s.size()-1][1]);
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3476kb

input:

00011011001

output:

2

result:

ok 1 number(s): "2"

Test #2:

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

input:

11101111111111111101001011110111111110011101010110

output:

11

result:

ok 1 number(s): "11"

Test #3:

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

input:

00000000100000000000100000010001000

output:

3

result:

ok 1 number(s): "3"

Test #4:

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

input:

00000000000000000000000000000000000000000000000000

output:

0

result:

ok 1 number(s): "0"

Test #5:

score: -100
Wrong Answer
time: 0ms
memory: 3536kb

input:

00000000100000000000100000011000

output:

3

result:

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