oj.uz

Submission #1061599

# Submission time Handle Problem Language Result Execution time Memory
1061599 2024-08-16T11:07:46 Z Energi Preokret (COCI18_preokret) Python 3
26.5 / 50
 65 ms 3168 KB 
As_Bs = [[], []]

ballAB = [0, 0]

for i in range(len(As_Bs)):
    A_B = int(input())
    for time in range(A_B):
        As_Bs[i].append(int(input()))
    As_Bs[i].sort()

s = As_Bs[0] + As_Bs[1]
s.sort()

grade = 0
for i in range(len(s)):
    if s[i] >= 1440:
        grade = len(s[:i])
        break

progress = 0
w = ''
for i in range(len(s)):
    if i == 0 and As_Bs[0].count(s[i]):
        w += 'A'
    elif i == 0 and As_Bs[1].count(s[i]):
        w += 'B'
    if As_Bs[0].count(s[i]):
        ballAB[0] += 1
    elif As_Bs[1].count(s[i]):
        ballAB[1] += 1
    if ballAB[1] != 0 and ballAB[0] > ballAB[1] and w == 'B':
        progress += 1
        w = 'A'
    elif ballAB[0] != 0 and ballAB[1] > ballAB[0] and w == 'A':
        progress += 1
        w = 'B'
print(grade, progress, sep= '\n')

Subtask #1
26.5 / 50.0

# Verdict Execution time Memory Grader output
1 Partially correct 16 ms 3168 KB Output is partially correct
2 Partially correct 12 ms 2820 KB Output is partially correct
3 Correct 15 ms 2908 KB Output is correct
4 Correct 12 ms 3004 KB Output is correct
5 Correct 14 ms 2908 KB Output is correct
6 Correct 24 ms 2908 KB Output is correct
7 Partially correct 65 ms 2908 KB Output is partially correct
8 Partially correct 39 ms 2908 KB Output is partially correct
9 Partially correct 64 ms 3164 KB Output is partially correct
10 Correct 15 ms 3048 KB Output is correct