제출 #90836

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
90836		zzee	Unija (COCI17_unija)	Cpython 3	20 / 100	128 ms	3892 KiB

unija

n = int(input())
L = []
L1 = []
p = 0
for i in range(200):
    for j in range(200):
        L1 = L1 + [0]
    L = L + [L1]
    L1 = []
for m in range(n):
    x,y = map(int, input().split())
    xk = x // 2
    yk = y // 2
    for i in range(yk):
        for j in range(xk):
            L[i][j] = 1
for i in range(200):
    for j in range(200):
        if L[i][j] == 1:
            p = p + 1
print(p*4)

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 10 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10