146072025-01-20 15:10:41GervidLudak Harcacpp17Accepted 100/10010ms824 KiB
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>

using namespace std;

int main()
{
	iostream::sync_with_stdio(0);
	cin.tie(0);

	int n, i, ans;
	cin >> n;

	vector<int> tiles(n);
	for (i = 0; i < n; i++) cin >> tiles[i];

	for (int step = 1; step <= 6; step++)
	{
		i = step, ans = 1;
		while (i < n)
		{
			while (i < n && tiles[i] != 0)
			{
				i += tiles[i];
			}
			if (i < n)
			{
				i += step, ans++;
			}
		}
		cout << ans << ' ';
	}
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms316 KiB
2Accepted1ms316 KiB
subtask225/25
3Accepted1ms316 KiB
4Accepted1ms316 KiB
5Accepted1ms316 KiB
6Accepted2ms316 KiB
7Accepted8ms820 KiB
subtask340/40
8Accepted1ms508 KiB
9Accepted1ms316 KiB
10Accepted2ms500 KiB
11Accepted3ms316 KiB
12Accepted4ms564 KiB
13Accepted8ms564 KiB
14Accepted8ms564 KiB
15Accepted10ms820 KiB
subtask435/35
16Accepted2ms500 KiB
17Accepted3ms500 KiB
18Accepted4ms316 KiB
19Accepted4ms564 KiB
20Accepted6ms564 KiB
21Accepted7ms564 KiB
22Accepted8ms564 KiB
23Accepted8ms564 KiB
24Accepted8ms628 KiB
25Accepted10ms824 KiB