oj.uz

Submission #247953

# Submission time Handle Problem Language Result Execution time Memory
247953 2020-07-12T06:54:41 Z VEGAnn Telefoni (COCI17_telefoni) C++14
80 / 80
 17 ms 2048 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 500100;
int n, a[N], d, ans;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n >> d;

    for (int i = 0; i < n; i++)
        cin >> a[i];

    int pos = 0;

    while (pos < n - 1){
        bool was = 0;

        for (int it = 1; it <= d; it++)
            if (a[pos + it]){
                was = 1;
                pos += it;
                break;
            }

        if (!was){
            ans++;
            pos += d;
        }
    }

    cout << ans;

    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 17 ms 2048 KB Output is correct
9 Correct 15 ms 2048 KB Output is correct
10 Correct 17 ms 2048 KB Output is correct