F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Gray code

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1469    Accepted Submission(s): 794


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.
 

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)
 

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
 

Hint

https://en.wikipedia.org/wiki/Gray_code

http://baike.baidu.com/view/358724.htm
 

Author
UESTC
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-22 11:51:09, Gzip enabled