https://www.51nod.com/Challenge/Problem.html#!#problemId=1663
很显然,两个人的策略都是从前往后取,先手取1,后手取0
影响答案的因素只有:0数量,1数量,?数量,最后一个0和1的位置,最后两个?的位置
#include<bits/stdc++.h>
using namespace std;
char s[100005];
int n,l1=-1,l0=-1,s1,s0,tot,l=-5,r=-5;
inline bool judge_01()
{
int l1=-1,l0=-1,s1=0,s0=0,tot=0,l=-5,r=-5;
for (int i=0;i<n;i++) if (s[i]=='1'){l1=i;s1++;}
else if (s[i]=='0'){l0=i;s0++;}
else{tot++;l=r;r=i;}
return (l0>=0 && l1>l0 && s0+tot-1!=s1-2-(n&1) && s0-2<s1+tot-(n&1) && s0+tot>s1-2-(n&1));
}
inline bool judge_10()
{
int l1=-1,l0=-1,s1=0,s0=0,tot=0,l=-5,r=-5;
for (int i=0;i<n;i++) if (s[i]=='1'){l1=i;s1++;}
else if (s[i]=='0'){l0=i;s0++;}
else{tot++;l=r;r=i;}
return (l1>=0 && l0>l1 && s0-2!=s1+tot-(n&1)-1 && s0-2<s1+tot-(n&1) && s0+tot>s1-2-(n&1));
}
int main()
{
scanf("%s",s);n=strlen(s);
for (int i=0;i<n;i++) if (s[i]=='1'){l1=i;s1++;}
else if (s[i]=='0'){l0=i;s0++;}
else{tot++;l=r;r=i;}
if (s0+tot-2>=s1-(n&1)) puts("00");
bool f01=0,f10=0;
if (l>=0) for (s[l]='0';s[l]<='1';s[l]++) for (s[r]='0';s[r]<='1';s[r]++) f01=f01||judge_01(),f10=f10||judge_10();
else if (r>=0) for (s[r]='0';s[r]<='1';s[r]++) f01=f01||judge_01(),f10=f10||judge_10();
else f01=f01||judge_01(),f10=f10||judge_10();
if (f01) puts("01");
if (f10) puts("10");
if (s0<=s1+tot-2-(n&1)) puts("11");
}