Submission #1268412

#TimeUsernameProblemLanguageResultExecution timeMemory
1268412juan_alejandroTelefoni (COCI17_telefoni)C++20
24 / 80
12 ms4936 KiB
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#define endl '\n'
#define int long long

using namespace std;
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout.precision(0);
    cout<<fixed;
    int n,d;
    cin>>n>>d;
    vector<int> x(n);
    vector<int> tab(n);
    for (int i = 0; i < n; i++)
    {
        cin>>x[i];
        if(i!=0)
        tab[i]=tab[i-1]+x[i];else
        tab[i]=x[i];
    }
    int res=0;
    for (int i = 0; i < n-1; i++)
    {
        if(tab[min(i+d,n-1)]-tab[i]==0&&x[i]==1)
        {
            res++;
            x[min(i+d,n-1)]=1;
            i=min(i+d,n-1);
        }
    }
    /*for (int i = 0; i < n; i++)
    {
        cout<<x[i]<<" ";
    }*/
    
    cout<<res<<endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...