제출 #1314760

#제출 시각아이디문제언어결과실행 시간메모리
1314760vikgupRasvjeta (COCI17_rasvjeta)Pypy 3
50 / 50
156 ms48772 KiB
def calc_count(dist, rng): mod = dist%rng count = dist//rng if mod == 0: return count return count + 1 n = int(input()) m = int(input()) k = int(input()) rnge = (2*k) + 1 lights = [] for _ in range(m): lights.append(int(input())) ranges = [] ranges.append(0) for l in lights: ranges.append(l-k) ranges.append(l+k) ranges.append(n+1) ans = 0 for i in range(0,len(ranges),2): diff = ranges[i+1]-ranges[i] if diff <= 1: continue else: ans += calc_count(diff - 1, rnge) print(ans)

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

Compiling 'rasjveta.py'...

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

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