| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1309326 | yyrtc | Rabbit Carrot (LMIO19_triusis) | Pypy 3 | 151 ms | 51080 KiB |
# rabbit question
N, m = map(int, input().split())
l = [0]
for _ in range(N):
l.append(int(input()))
count = 0
curr = 0
for i in range(1, len(l)):
if curr + m < l[i]:
count += 1
curr = curr + m
else:
curr = l[i]
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... | ||||
