oj.uz

Submission #644522

# Submission time Handle Problem Language Result Execution time Memory
644522 2022-09-24T18:50:34 Z ali72 Telefoni (COCI17_telefoni) C++17
80 / 80
 13 ms 1492 KB 
#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;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 12 ms 1492 KB Output is correct
9 Correct 13 ms 1492 KB Output is correct
10 Correct 13 ms 1492 KB Output is correct