Submission #856088

#TimeUsernameProblemLanguageResultExecution timeMemory
856088vjudge1Telefoni (COCI17_telefoni)C++17
0 / 80
1095 ms4956 KiB
#include <bits/stdc++.h>
using namespace std;
#define sp << " " << 
#define int long long
#define vi vector<int>
#define pb push_back
#define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++)
#define pii pair<int,int>
#define all(x) x.begin()+1,x.end()
const int N = 4e5+1;


void solve() {
	int n,d;
	cin >> n >> d;
	vi a(n+1);
	F(i,n) cin >> a[i];
	vi l(n+1);
	int lst = 1;
	F(i,n) {
		if (a[i]) lst = i;
		l[i] = lst;
	}
	int ans = 0;
	int ptr = n;
	while (ptr != 1) {
		if (l[ptr] < ptr-d) {
			ans++;
			ptr=max(1ll,ptr-d);
		}
		else ptr = l[ptr];
	}
	cout << ans << endl;	
}     	
                 
                 
                 
                 
                 
                 
                 
                 
                                
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}


#Verdict Execution timeMemoryGrader output
Fetching results...