# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209147 | pavement | Telefoni (COCI17_telefoni) | C++17 | 20 ms | 380 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 int long long
int N, D, U;
vector<int> P;
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> D;
for (int i = 1, B; i <= N; i++) {
cin >> B;
if (B) P.push_back(i);
}
for (int p = 1; p < N; ) {
auto it = upper_bound(P.begin(), P.end(), p + D);
if (it != P.begin()) {
--it;
if (*it > p) p = *it;
else U++, p += D;
} else U++, p += D;
}
cout << U << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |