Submission #636409

# Submission time Handle Problem Language Result Execution time Memory
636409 2022-08-29T08:17:56 Z dozer Telefoni (COCI17_telefoni) C++14
80 / 80
15 ms 2016 KB
#include <bits/stdc++.h>
using namespace std;
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define sp " "
#define endl "\n"
#define pb push_back
#define pii pair<int , int>
#define st first
#define nd second
#define N 300005


int arr[N];

int32_t main()
{
	fastio();

	int n, d;
	cin>>n>>d;
	for (int i = 1; i <= n; i++)
		cin>>arr[i];
	int last = 0, i = 1, ans = 0;
	while(i < n)
	{
		for (int j = i; j <= min(i + d, n); j++)
		{
			if (arr[j] == 1) last = j;
		}
		if (last == i)
		{
			last = i + d;
			ans++;
		}
		i = last;
	}

	cout<<ans<<endl;

	cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 15 ms 1968 KB Output is correct
9 Correct 13 ms 2016 KB Output is correct
10 Correct 13 ms 2004 KB Output is correct