Submission #49706552


Source Code Expand

def main():
    N = int(input())
    Q = [int(x) for x in input().split()]
    A = [int(x) for x in input().split()]
    B = [int(x) for x in input().split()]
    ans = 0
    for i in range(10**6 + 1):
        if min((Q[j] - A[j] * i) for j in range(N)) < 0:
            break
        ans = max(ans, min((Q[j] - A[j] * i) // B[j] for j in range(N) if B[j] > 0) + i)
    print(ans)


if __name__ == "__main__":
    main()

Submission Info

Submission Time
Task C - Leftover Recipes
User n_knuu
Language Python (CPython 3.11.4)
Score 300
Code Size 436 Byte
Status AC
Exec Time 1145 ms
Memory 8644 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 18
Set Name Test Cases
Sample 01-sample.txt, 02-sample.txt, 03-sample.txt, 04-sample.txt
All 01-sample.txt, 02-sample.txt, 03-sample.txt, 04-sample.txt, 05-hidden.txt, 06-hidden.txt, 07-hidden.txt, 08-hidden.txt, 09-hidden.txt, 10-hidden.txt, 11-hidden.txt, 12-hidden.txt, 13-hidden.txt, 14-hidden.txt, 15-hidden.txt, 16-hidden.txt, 17-hidden.txt, 18-hidden.txt
Case Name Status Exec Time Memory
01-sample.txt AC 10 ms 8588 KiB
02-sample.txt AC 10 ms 8492 KiB
03-sample.txt AC 10 ms 8428 KiB
04-sample.txt AC 297 ms 8512 KiB
05-hidden.txt AC 10 ms 8504 KiB
06-hidden.txt AC 161 ms 8644 KiB
07-hidden.txt AC 1132 ms 8500 KiB
08-hidden.txt AC 384 ms 8628 KiB
09-hidden.txt AC 1145 ms 8448 KiB
10-hidden.txt AC 388 ms 8596 KiB
11-hidden.txt AC 118 ms 8528 KiB
12-hidden.txt AC 62 ms 8624 KiB
13-hidden.txt AC 113 ms 8476 KiB
14-hidden.txt AC 62 ms 8500 KiB
15-hidden.txt AC 10 ms 8532 KiB
16-hidden.txt AC 490 ms 8632 KiB
17-hidden.txt AC 10 ms 8472 KiB
18-hidden.txt AC 10 ms 8520 KiB