Travel Pass solution codechef

Travel Pass solution codechef

For Solution

Click Here!

Chef is going on a road trip and needs to apply for inter-district and inter-state travel e-passes. It takes AA minutes to fill each inter-district e-pass application and BB minutes for each inter-state e-pass application.

His journey is given to you as a binary string SS of length NN where 00 denotes crossing from one district to another district (which needs an inter-district e-pass), and a 11 denotes crossing from one state to another (which needs an inter-state e-pass).

Find the total time Chef has to spend on filling the various forms.

Input Format Travel Pass solution codechef

  • The first line of the input contains a single integer TT denoting the number of test cases. The description of TT test cases follows.
  • Each test case contains two lines of input.
  • First line contains three space separated integers N,AN,A and BB.
  • Second line contains the string SS.

Output Format

For each testcase, output in a single line the total time Chef has to spend on filling the various forms for his journey.

Constraints Travel Pass solution codechef

  • 1T1021≤T≤102
  • 1N,A,B1021≤N,A,B≤102
  • Si{0,1}Si∈{′0′,′1′}


Subtask #1 (100 points): original constraints

Sample Input 1 

2 1 2
2 1 1
4 2 1

Sample Output 1  Travel Pass solution codechef 



Test case 11: Chef needs total 22 inter-district e-passes, and he will be filling them in total 12=21⋅2=2 minutes.

Test case 33: Chef needs total 11 inter-district e-pass and 33 inter-state e-passes, and he will be filling them in total 21+13=52⋅1+1⋅3=5 minutes.

For Solution

Click Here!

Leave a Comment

Your email address will not be published.