oj.uz

Submission #644517

# Submission time Handle Problem Language Result Execution time Memory
644517 2022-09-24T18:42:45 Z ali72 Telefoni (COCI17_telefoni) C++17
16 / 80
 17 ms 2008 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;
    for(int i = 0;i < n;i+=d){
            if(v[i] == 0){
                ans++;
                v[i] = 1;
            }
    }
    if(v[n - 1] == 0) ans++;
    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
16.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Incorrect 0 ms 340 KB Output isn't correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Incorrect 1 ms 320 KB Output isn't correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Incorrect 15 ms 2008 KB Output isn't correct
9 Incorrect 17 ms 2004 KB Output isn't correct
10 Incorrect 17 ms 1996 KB Output isn't correct