Submission #74109607

Source Code Expand

a,b,q=map(int,input().split())
u=[list(map(int,input().split()))for i in range(q)]
for i in range(q):
  if u[i][0]==2:
    print(u[i][1]*a)
    b=b-u[i][1]
  if u[i][0]==1:
    print(u[i][1]*b)
    a=a-u[i][1]

Submission Info

Submission Time
Task B - Deconstruct Chocolate
User usuaji288
Language Python (PyPy 3.11-v7.3.20)
Score 200
Code Size 223 Byte
Status AC
Exec Time 55 ms
Memory 80568 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 1
AC × 21
Set Name Test Cases
Sample sample00.txt
All sample00.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt
Case Name Status Exec Time Memory
sample00.txt AC 53 ms 79852 KiB
testcase00.txt AC 54 ms 79980 KiB
testcase01.txt AC 55 ms 80424 KiB
testcase02.txt AC 55 ms 80344 KiB
testcase03.txt AC 55 ms 80260 KiB
testcase04.txt AC 54 ms 79808 KiB
testcase05.txt AC 55 ms 80344 KiB
testcase06.txt AC 54 ms 80128 KiB
testcase07.txt AC 54 ms 80568 KiB
testcase08.txt AC 53 ms 79852 KiB
testcase09.txt AC 54 ms 80456 KiB
testcase10.txt AC 54 ms 80160 KiB
testcase11.txt AC 54 ms 80428 KiB
testcase12.txt AC 54 ms 79764 KiB
testcase13.txt AC 54 ms 79620 KiB
testcase14.txt AC 54 ms 79928 KiB
testcase15.txt AC 53 ms 79672 KiB
testcase16.txt AC 55 ms 80544 KiB
testcase17.txt AC 55 ms 80324 KiB
testcase18.txt AC 55 ms 80312 KiB
testcase19.txt AC 55 ms 80544 KiB