oj.uz

Submission #676145

# Submission time Handle Problem Language Result Execution time Memory
676145 2022-12-29T13:36:53 Z LeonaRaging Telefoni (COCI17_telefoni) C++14
80 / 80
 17 ms 1776 KB 
#include <bits/stdc++.h>
using namespace std;

#define db(val) "[" #val " = " << (val) << "] "

const int maxn = 3e5 + 4;

int n, d, nxt[maxn];
bool a[maxn];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> d;
    for (int i = 1; i <= n; i++)
    	cin >> a[i];
    queue<int> q;
    for (int i = n; i >= 1; i--) {
    	while (!q.empty() && q.front() > i + d)
    		q.pop();
    	nxt[i] = (!q.empty() ? q.front() : 0);
    	if (a[i]) q.push(i);
    }
    int cur = 1, res = 0;
    while (cur < n) {
    	if (nxt[cur]) cur = nxt[cur];
    	else res++, cur = cur + d;
    }
    cout << res;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 17 ms 1664 KB Output is correct
9 Correct 17 ms 1748 KB Output is correct
10 Correct 17 ms 1776 KB Output is correct