# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676145 | LeonaRaging | Telefoni (COCI17_telefoni) | C++14 | 17 ms | 1776 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |