oj.uz

Submission #1055279

# Submission time Handle Problem Language Result Execution time Memory
1055279 2024-08-12T16:20:15 Z fryingduc Telefoni (COCI17_telefoni) C++17
80 / 80
 8 ms 2144 KB 
/* #pragma GCC optimize("Ofast,unroll-loops") */
#include "bits/stdc++.h"
using namespace std;

#ifdef duc_debug
#include "bits/debug.h"
#else 
#define debug(...)     
#endif

/* #define int long long */

const int mod = 300'007;
int n, d, a[mod];
void solve(){
    cin >> n >> d;
    for(int i = 1; i <= n; i++) cin >> a[i];
    int ans = 0, last_one = 1;
    for(int i = 2; i <= n; i++){
        if(i - last_one >= d){
            if(a[i] == 0) ans++;
            a[i] = 1;
        }
        if(a[i] == 1) last_one = i;
    }
    cout << ans;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int test = 1;
    /* cin >> test; */
    for(int i = 1; i <= test; i++){
        /* cout << "Case " << "#" << i << ": "; */
        solve();
    }

    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 8 ms 2140 KB Output is correct
9 Correct 8 ms 2140 KB Output is correct
10 Correct 8 ms 2144 KB Output is correct