# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75032 | charlies_moo | Telefoni (COCI17_telefoni) | C++98 | 4 ms | 1236 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 <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int n,d,ans;
int a[10001];
int main()
{
cin>>n>>d;
for(int i=1;i<=n;i++)
cin>>a[i];
int v;
for(int i=1;i<=n;i++)
{
v=i;
for(int j=min(d+v,n);j>v;j--)
{
if(a[j]==0)
{
ans++,a[j]++,i=j-1;
break;
}
if(j==v+1)
i=j-1;
}
}
cout<<ans;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |