oj.uz

Submission #1087056

# Submission time Handle Problem Language Result Execution time Memory
1087056 2024-09-12T06:56:09 Z toast12 Telefoni (COCI17_telefoni) C++14
80 / 80
 28 ms 2140 KB 
#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;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 25 ms 1988 KB Output is correct
9 Correct 25 ms 2140 KB Output is correct
10 Correct 28 ms 2112 KB Output is correct