Submission #3454608


Source Code Expand

import math


def main():
    N = int(input())
    T = []
    A = []
    for i in range(N):
        t, a = map(int, input().split())
        T.append(t)
        A.append(a)

    for i in range(N - 1):

        if T[i] / T[i + 1] > 1 or A[i] / A[i + 1] > 1:
            mul = max(math.ceil(T[i] / T[i + 1]), math.ceil(A[i] / A[i + 1]))
            A[i + 1] *= mul
            T[i + 1] *= mul
    print(T[N - 1] + A[N - 1])


if __name__ == "__main__":
    main()

Submission Info

Submission Time
Task C - AtCoDeer and Election Report
User Xiii111
Language Python (3.4.3)
Score 0
Code Size 485 Byte
Status WA
Exec Time 21 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 11
WA × 4
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt
Case Name Status Exec Time Memory
0_000.txt AC 17 ms 3064 KB
0_001.txt AC 17 ms 3064 KB
0_002.txt AC 17 ms 3064 KB
1_003.txt AC 17 ms 3064 KB
1_004.txt AC 19 ms 3064 KB
1_005.txt WA 18 ms 3064 KB
1_006.txt AC 19 ms 3064 KB
1_007.txt AC 18 ms 3064 KB
1_008.txt AC 17 ms 3064 KB
1_009.txt WA 17 ms 3064 KB
1_010.txt AC 17 ms 3064 KB
1_011.txt AC 17 ms 3064 KB
1_012.txt WA 17 ms 3064 KB
1_013.txt WA 20 ms 3064 KB
1_014.txt AC 21 ms 3064 KB