codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1315B.md (3367B)


      1 Source: https://codeforces.com/problemset/problem/1315/B
      2 
      3 B. Homecoming
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 After a long party Petya decided to return home, but he turned out to be at the opposite end of the town from his home. There are $n$ crossroads in the line in the town, and there is either the bus or the tram station at each crossroad.
     22 
     23 The crossroads are represented as a string $s$ of length $n$, where $s_i = \texttt{A}$, if there is a bus station at $i$-th crossroad, and $s_i = \texttt{B}$, if there is a tram station at $i$-th crossroad. Currently Petya is at the first crossroad (which corresponds to $s_1$) and his goal is to get to the last crossroad (which corresponds to $s_n$).
     24 
     25 If for two crossroads $i$ and $j$ for all crossroads $i, i+1, \ldots, j-1$ there is a bus station, one can pay $a$ roubles for the bus ticket, and go from $i$-th crossroad to the $j$-th crossroad by the bus (it is not necessary to have a bus station at the $j$-th crossroad). Formally, paying $a$ roubles Petya can go from $i$ to $j$ if $s_t = \texttt{A}$ for all $i \le t \lt j$.
     26 
     27 If for two crossroads $i$ and $j$ for all crossroads $i, i+1, \ldots, j-1$ there is a tram station, one can pay $b$ roubles for the tram ticket, and go from $i$-th crossroad to the $j$-th crossroad by the tram (it is not necessary to have a tram station at the $j$-th crossroad). Formally, paying $b$ roubles Petya can go from $i$ to $j$ if $s_t = \texttt{B}$ for all $i \le t \lt j$.
     28 
     29 For example, if $s$="AABBBAB", $a=4$ and $b=3$ then Petya needs:
     30 
     31 ![](https://espresso.codeforces.com/cdb4635b8bb0234f87d3e22260f49849fcaa2007.png)
     32 
     33 * buy one bus ticket to get from $1$ to $3$,
     34 * buy one tram ticket to get from $3$ to $6$,
     35 * buy one bus ticket to get from $6$ to $7$.
     36 
     37 Thus, in total he needs to spend $4+3+4=11$ roubles. Please note that the type of the stop at the last crossroad (i.e. the character $s_n$) does not affect the final expense.
     38 
     39 Now Petya is at the first crossroad, and he wants to get to the $n$-th crossroad. After the party he has left with $p$ roubles. He's decided to go to some station on foot, and then go to home using only public transport.
     40 
     41 Help him to choose the closest crossroad $i$ to go on foot the first, so he has enough money to get from the $i$-th crossroad to the $n$-th, using only tram and bus tickets.
     42 
     43 Input
     44 
     45 Each test contains one or more test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^4$).
     46 
     47 The first line of each test case consists of three integers $a, b, p$ ($1 \le a, b, p \le 10^5$) — the cost of bus ticket, the cost of tram ticket and the amount of money Petya has.
     48 
     49 The second line of each test case consists of one string $s$, where $s_i = \texttt{A}$, if there is a bus station at $i$-th crossroad, and $s_i = \texttt{B}$, if there is a tram station at $i$-th crossroad ($2 \le |s| \le 10^5$).
     50 
     51 It is guaranteed, that the sum of the length of strings $s$ by all test cases in one test doesn't exceed $10^5$.
     52 
     53 Output
     54 
     55 For each test case print one number — the minimal index $i$ of a crossroad Petya should go on foot. The rest of the path (i.e. from $i$ to $n$ he should use public transport).
     56 
     57 Example
     58 
     59 Input
     60 
     61 ```
     62 5
     63 2 2 1
     64 BB
     65 1 1 1
     66 AB
     67 3 2 8
     68 AABBBBAABB
     69 5 3 4
     70 BBBBB
     71 2 1 1
     72 ABABAB
     73 ```
     74 
     75 Output
     76 
     77 ```
     78 2
     79 1
     80 3
     81 1
     82 6
     83 ```