제출 #1328797

#제출 시각아이디문제언어결과실행 시간메모리
1328797model_codeZombie (COCI26_zombie)Pypy 3
50 / 50
160 ms50648 KiB
n, m, k = map(int, input().split())
x, r, t = [], [], []

for _ in range(k):
    xi, ri, ti = map(int, input().split())
    x.append(xi)
    r.append(ri)
    t.append(ti)

br = 0
for i in range(1, m + 1):
    prezivio = 1
    for j in range(k):
        lj = max(x[j] - r[j], 1)
        rj = min(x[j] + r[j], n)
        poz = t[j] - i + 1
        if poz >= lj and poz <= rj:
            prezivio = 0
    if prezivio == 1:
        br = br + 1;

print(br)

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 29%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...