Gray code
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 285 Accepted Submission(s): 156
Problem Description
The reflected binary code, also known as Gray code after Frank Gray, is a binary numeral system where two successive values differ in only onebit (binary digit). The reflected binary code was originally designed to prevent spurious output from electromechanical switches. Today, Gray codes are widely used to facilitate error correction in digital communications such as digital terrestrial television and some cable TV systems.
Now , you are given a binary number of length n including ‘0’ , ’1’ and ‘?’(? means that you can use either 0 or 1 to fill this position) and n integers(a1,a2,….,an) . A certain binary number corresponds to a gray code only. If the ith bit of this gray code is 1,you can get the point ai.
Can you tell me how many points you can get at most?
For instance, the binary number “00?0” may be “0000” or “0010”,and the corresponding gray code are “0000” or “0011”.You can choose “0000” getting nothing or “0011” getting the point a3 and a4.
![](https://i-blog.csdnimg.cn/blog_migrate/c883933cbffdc1f310152072c114cbe2.jpeg)
Now , you are given a binary number of length n including ‘0’ , ’1’ and ‘?’(? means that you can use either 0 or 1 to fill this position) and n integers(a1,a2,….,an) . A certain binary number corresponds to a gray code only. If the ith bit of this gray code is 1,you can get the point ai.
Can you tell me how many points you can get at most?
For instance, the binary number “00?0” may be “0000” or “0010”,and the corresponding gray code are “0000” or “0011”.You can choose “0000” getting nothing or “0011” getting the point a3 and a4.
Input
The first line of the input contains the number of test cases T.
Each test case begins with string with ‘0’,’1’ and ‘?’.
The next line contains n (1<=n<=200000) integers (n is the length of the string).
a1 a2 a3 … an (1<=ai<=1000)
Each test case begins with string with ‘0’,’1’ and ‘?’.
The next line contains n (1<=n<=200000) integers (n is the length of the string).
a1 a2 a3 … an (1<=ai<=1000)
Output
For each test case, output “Case #x: ans”, in which x is the case number counted from one,’ans’ is the points you can get at most
Sample Input
2 00?0 1 2 4 8 ???? 1 2 4 8
Sample Output
Case #1: 12 Case #2: 15
如果tou跟wei不一样就相反,碰到奇数的就舍弃个最小的,偶数的全取。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
using namespace std;
const int INF=0x3f3f3f3f;
int a[200000+100];
string s;
int main()
{
int t;
int ca=1;
scanf("%d",&t);
while(t--)
{
cin>>s;
int n=s.size();
int sum=0;
for(int i=0;i<n;i++)
{
scanf("%d",a+i);
sum+=a[i];
}
int tou=0,wei;
int mi=INF;
int ans=0;
int cnt=0;
for(int i=0;i<n;++i)
{
if(s[i]=='?'){
cnt++;
if(mi>a[i])mi=a[i];
}
else {
wei=s[i]-'0';
if(mi>a[i])mi=a[i];
if(!cnt){
if(tou==wei)ans+=a[i];
}
else if(wei==tou){
if(!(cnt&1))ans+=mi;
}
else if(cnt&1)ans+=mi;
mi=INF;
cnt=0;
tou=wei;
}
}
printf("Case #%d: ",ca++);
cout<<sum-ans<<endl;
}
return 0;
}