# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1087056 | toast12 | Telefoni (COCI17_telefoni) | C++14 | 28 ms | 2140 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;
int main() {
int n, d;
cin >> n >> d;
vector<int> telephones(n+1);
for (int i = 1; i <= n; i++) {
cin >> telephones[i];
}
int ans = 0;
int last = 1;
int i = last;
while (i < n) {
int x = last;
for (int j = i; j <= min(n, i + d); j++) {
if (telephones[j])
x = j;
}
if (x == last) {
ans++;
last += d;
i = last;
}
else {
i = x;
last = x;
}
}
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |