Am I the only one who thought that in C you need to find the SUM of penalties?

I initially thought D was a combinatorics problem and got WA several times, but now I see it's actually DP.

D is easier than usual and I'm completely stuck by the problem E. I try to guess the conclusion, but failed finally.

FOR 2070D — Tree Jumps

I know it's a DP question, but I approached it more like a combinatorial problem and got a WA as a result. I want to understand why I got WA. Can anyone provide a test case where my approach fails or explain the reason behind it?

308241176

When could the text editorial be visible awa?

Problem B doubt

def s_extend(s, n, k):

quo = k // n 
rem = k % n 
return s * quo + s[:rem]

t = int(input())
for i in range(t):

n, x, k = map(int, input().split()) 
s = input() 

s_n = s_extend(s, n, k) 

pos = x
cnt = 0
rp = 0

while k > 0:
    if s_n[rp] == 'L':
        pos -= 1
    elif s_n[rp] == 'R':
        pos += 1

    if pos == 0:
        cnt += 1
        rp = -1

    rp += 1
    if rp == len(s_n):
        rp = 0

    k -= 1

print(cnt)

For problem B, how can you optimise further ?? Got TLE on Test 1 last input.