658A - Bear and Reverse Radewoosh - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:

n, c = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))

score = 0
sum = 0
for i in range(n):
    sum += t[i]
    score += max(0, (p[i]-(sum*c)))
summ = 0
scoree = 0
for i in range(n-1, -1, -1):
    summ += t[i]
    scoree += max(0, (p[i]-(summ*c)))
if(scoree>score):
    print("Radewoosh")
elif(score==scoree):
    print("Tie")
else:
    print("Limak")



    
    


Comments

Submit
0 Comments
More Questions

479C - Exams
1030A - In Search of an Easy Problem
158A - Next Round
71A - Way Too Long Words
160A - Twins
1A - Theatre Square
1614B - Divan and a New Project
791A - Bear and Big Brother
1452A - Robot Program
344A - Magnets
96A - Football
702B - Powers of Two
1036A - Function Height
443A - Anton and Letters
1478B - Nezzar and Lucky Number
228A - Is your horseshoe on the other hoof
122A - Lucky Division
1611C - Polycarp Recovers the Permutation
432A - Choosing Teams
758A - Holiday Of Equality
1650C - Weight of the System of Nested Segments
1097A - Gennady and a Card Game
248A - Cupboards
1641A - Great Sequence
1537A - Arithmetic Array
1370A - Maximum GCD
149A - Business trip
34A - Reconnaissance 2
59A - Word
462B - Appleman and Card Game