/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 15ms 2.996 MiB
#2 Wrong Answer 15ms 3.121 MiB
#3 Wrong Answer 15ms 2.906 MiB

Code

def max_bricks(a, b, c, d):

    one_squares = a
    two_squares = b // 2
    three_squares = c

    rotated_Ls = d // 2
    l_squares_horizontal = (d - rotated_Ls) // 2
    l_squares_vertical = min(rotated_Ls, three_squares)

    total_squares = one_squares + two_squares + three_squares + l_squares_horizontal + l_squares_vertical
    return total_squares // 3

t = int(input())
for case in range(1, t + 1):
    a, b, c, d = map(int, input().split())
    max_brick_count = max_bricks(a, b, c, d)
    print(f"Case {case}: {max_brick_count}")



Information

Submit By
Type
Submission
Problem
P1014 FIFA World Cup 2022 Again!
Language
Python 3 (Python 3.12.3)
Submit At
2024-01-09 11:29:47
Judged At
2024-11-11 03:43:39
Judged By
Score
1
Total Time
15ms
Peak Memory
3.121 MiB