poj2931 Procrastination----不平等博弈
#include<iostream>#include<cstdlib>#include<stdio.h>using namespace std;int tt[55];long long dfs(int n){ long long x=0,k=1; int i=1; k<<=52;//先乘上一个数 while(i<=n&&tt[i]==tt[1]) { if(tt[i]==1) x+=k; else x-=k; i++; } k>>=1; while(i<=n) { if(tt[i]==1) x=x+k; else x=x-k; i++; k>>=1; } return x;}void solve(int n){ for(int i=1;i<=n;i++) { char c; cin>>c; if(c=='W') tt[i]=1; else tt[i]=0; }}int main(){ int t,d; char str[10]; int a[55]; scanf("%d",&t); while(t--) { scanf("%s%d",str,&d); char c; int n1,n2,n3; //cout<<str<<" "<<d<<endl; scanf("%d%d%d",&n1,&n2,&n3); long long ans1=0,ans2=0; solve(n1);ans1+=dfs(n1); solve(n2);ans1+=dfs(n2); solve(n3);ans1+=dfs(n3); scanf("%d%d%d",&n1,&n2,&n3); solve(n1);ans2+=dfs(n1); solve(n2);ans2+=dfs(n2); solve(n3);ans2+=dfs(n3); printf("%s %d: ",str,d); // cout<<ans1<<" "<<ans2<<endl; if(ans1>=ans2) puts("Yes"); else puts("No"); }}

1楼ACM_cxlove昨天 21:00

哭瞎，太神了，ORZ

Re: qiqijianglu昨天 21:02

回复ACM_cxloven照着论文敲的，弱得很……