#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll aa[200005],bb[200005],n;
ll f(ll *p)
{
ll cnt=0,sum=0;
for(int i=0;i<=n;i++)
{
if(p[i]==0 || i==n){
sum+=cnt*(cnt+1)/2;cnt=0;continue;}
cnt++;
}
return sum;
}
ll cal(string t)
{
ll cnt=0,sum=0;
for(int i=0;i<=n;i++)
{
if(t[i]!='?' || i==n){
sum+=cnt*(cnt+1)/2;cnt=0;continue;}
cnt++;
}
return sum;
}
void solve(){
string t;
cin>>t;
n=t.size();
for(int i=0;i<n;i++)aa[i]=bb[i]=0;
string tmp="01";
for(ll i=0;i<n;i++)if(t[i]=='?' || t[i]==tmp[i%2])aa[i]=1;//-'0'
next_permutation(tmp.begin(),tmp.end());
for(ll i=0;i<n;i++)if(t[i]=='?' || t[i]==tmp[i%2])bb[i]=1;
ll sum=0;
sum=f(aa)+f(bb)-cal(t);
printf("%lld\n",sum);
}
int main()
{
ll T;
scanf("%lld",&T);
while(T--)solve();
return 0;
}
CF 1519D Maximum Sum of Products
Supongo que te gusta
Origin blog.csdn.net/Ambrumf/article/details/120900660
Recomendado
Clasificación