| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 644522 | ali72 | Telefoni (COCI17_telefoni) | C++17 | 13 ms | 1492 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/extc++.h>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
void ALI_72(){
    int n,d;
    cin >> n >> d;
    vector < int > v(n);
    for(auto& i : v) cin >> i;
    int ans = 0,  point = 0;
    for(int i = 0;i < n;i++){
        if(v[i]){
            point = i + d;
            continue;
        }else if(i == point){
            ans++;
            point = i + d;
        }
    }
    cout << ans << '\n';
}
signed main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
     ALI_72();
   }
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
