Travel Pass (TRAVELPS) | September Challenge 2021 Division 3 | CodeChef August Long Challenge

Описание: Travel Pass (TRAVELPS) | September Challenge 2021 Division 3 | CodeChef August Long Challenge

Travel Pass (TRAVELPS)

Problem link :
https://www.codechef.com/SEPT21C/prob...

DSA Course link:
https://www.codechef.com/AUG21C?order...

Hi, thanks for watching our video .
In this video we’ll walk you through:
Concepts
Solution

ABOUT OUR CHANNEL

Our channel is all about Programming. We cover lots of cool stuff such as solution to problems, concept explanation and tricks to master CP
Check out our channel here:
   / @programmerszone  
Don’t forget to subscribe!

CHECK OUT OUR OTHER Playlists

GeeksforGeeks playlist:
   • GeeksforGeeks problems  

Complete C++ Course playlist:
   • Complete C++ playlist  

CodeChef Playlist:
   • CodeChef Problems  

LeetCode problems
   • Leetcode problems Solution  

HackerRank playlist:
   • HackeRank problems  

FIND US AT
https://www.waadanibhao.wordpress.com

GET IN TOUCH
Contact us on [email protected]

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

His journey is given to you as a binary string S of length N where 0 denotes crossing from one district to another district (which needs an inter-district e-pass), and a 1 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
The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
Each test case contains two lines of input.
First line contains three space separated integers N,A and B.
Second line contains the string S.
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
1≤T≤102
1≤N,A,B≤102
Si∈{′0′,′1′}
Subtasks
Subtask #1 (100 points): original constraints

Sample Input 1
3
2 1 2
00
2 1 1
01
4 2 1
1101
Sample Output 1
2
2
5
Explanation
Test case 1: Chef needs total 2 inter-district e-passes, and he will be filling them in total 1⋅2=2 minutes.

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

Author: daanish_adm
Date Added: 30-08-2021
Time Limit: 0.5 secs
Source Limit: 50000 Bytes
Languages: CPP14, C, JAVA, PYTH 3.6, CPP17, PYTH, PYP3, CS2, ADA, PYPY, TEXT, PAS fpc, NODEJS, RUBY, PHP, GO, HASK, TCL, PERL, SCALA, LUA, kotlin, BASH, JS, LISP sbcl, rust, PAS gpc, BF, CLOJ, R, D, CAML, FORT, ASM, swift, FS, WSPC, LISP clisp, SQL, SCM guile, PERL6, ERL, CLPS, ICK, NICE, PRLG, ICON, COB, SCM chicken, PIKE, SCM qobi, ST, SQLQ, NEM
Submit

#codechef #coding #python #hackerrank #programming #java #computerscience #coder #code #competitiveprogramming #machinelearning #pythonprogramming #algorithms #cpp #javascript #hackerearth #webdeveloper #geeksforgeeks #codinglife #leetcode #c #codeforces #engineering #codingmemes #programmer #hacker #programmingmemes #topcoder #webdevelopment #bhfyp