| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1309325 | yyrtc | Rabbit Carrot (LMIO19_triusis) | Pypy 3 | 154 ms | 51068 KiB |
# rabbit question
N, m = list(map(int, input().strip().split()))
l = [0]
for _ in range(N):
l.append(int(input()))
count = 0
for i in range(len(l) - 1):
if l[i] + m < l[i + 1]:
count += 1
l[i + 1] = l[i] + m
print(count)
Compilation message (stdout)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
