제출 #90838

#제출 시각아이디문제언어결과실행 시간메모리
90838zzeeUnija (COCI17_unija)Cpython 3
20 / 100
598 ms5792 KiB
n = int(input()) L = [] L1 = [] p = 0 for i in range(500): for j in range(500): 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(500): for j in range(500): if L[i][j] == 1: p = p + 1 print(p*4)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...