# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
237796 | marlicu | Telefoni (COCI17_telefoni) | C++14 | 25 ms | 1280 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;
const int MAXN = 3e5 + 5;
int n, d;
bool telefon[MAXN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> d;
for (int i = 0; i < n; i++) {
cin >> telefon[i];
}
int zadnji = 0;
int dodano = 0;
for (int i = 1; i < n; i++) {
if (telefon[i]) zadnji = i;
if (!telefon[i] && (i - zadnji) >= d) {
dodano++;
zadnji = i;
}
}
cout << dodano << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |