| 18803 | 2025-11-05 07:47:16 | diak | Ludak Harca | cpp17 | Accepted 100/100 | 12ms | 820 KiB |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n; cin >> n;
vector<int> j(n); for (int& e : j) cin >> e;
for (int k = 1; k <= 6; ++k) {
int ans = 0, i = 0;
while (i < n) {
if (j[i] != 0) { i += j[i]; continue; }
++ans; i += k; }
cout << ans << ' '; }
cout << '\n'; }
int main() { ios::sync_with_stdio(false); cin.tie(nullptr); solve(); return 0; }| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Accepted | 1ms | 316 KiB | ||||
| 2 | Accepted | 1ms | 316 KiB | ||||
| subtask2 | 25/25 | ||||||
| 3 | Accepted | 1ms | 316 KiB | ||||
| 4 | Accepted | 1ms | 316 KiB | ||||
| 5 | Accepted | 1ms | 316 KiB | ||||
| 6 | Accepted | 2ms | 316 KiB | ||||
| 7 | Accepted | 8ms | 608 KiB | ||||
| subtask3 | 40/40 | ||||||
| 8 | Accepted | 1ms | 316 KiB | ||||
| 9 | Accepted | 1ms | 316 KiB | ||||
| 10 | Accepted | 2ms | 508 KiB | ||||
| 11 | Accepted | 3ms | 316 KiB | ||||
| 12 | Accepted | 4ms | 564 KiB | ||||
| 13 | Accepted | 8ms | 748 KiB | ||||
| 14 | Accepted | 9ms | 564 KiB | ||||
| 15 | Accepted | 10ms | 820 KiB | ||||
| subtask4 | 35/35 | ||||||
| 16 | Accepted | 2ms | 512 KiB | ||||
| 17 | Accepted | 3ms | 316 KiB | ||||
| 18 | Accepted | 4ms | 316 KiB | ||||
| 19 | Accepted | 4ms | 564 KiB | ||||
| 20 | Accepted | 6ms | 564 KiB | ||||
| 21 | Accepted | 8ms | 564 KiB | ||||
| 22 | Accepted | 8ms | 564 KiB | ||||
| 23 | Accepted | 8ms | 564 KiB | ||||
| 24 | Accepted | 9ms | 564 KiB | ||||
| 25 | Accepted | 12ms | 820 KiB | ||||