oj.uz

Submission #209991

# Submission time Handle Problem Language Result Execution time Memory
209991 2020-03-16T08:06:23 Z AlainSu Telefoni (COCI17_telefoni) C++14
24 / 80
 1000 ms 632 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXN=3500000;
long long n,m,ans=0,tmp;
bool a[MAXN];
void input()
{
	cin>>n>>m;
	for (int i=1;i<=n;i++)
	    cin>>a[i];
}
void process()
{
	int now=1,maxr=m+1;
	while (maxr<n)
	{
	    for (int i=maxr;i>=now;i--)
	   	    if (a[i])
	   	    {
	   	    	tmp=i;
	   	    	break;
			}
		if (tmp==now)
		{
			ans++;
			now=maxr;
		}
		else
		{
			now=tmp;
		}
		maxr=now+m;
    }
}
void output()
{
	cout<<ans;
}
int main()
{
	input();
	process();
	output();
	return 0;
}

Subtask #1
24.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Execution timed out 1093 ms 256 KB Time limit exceeded
5 Execution timed out 1096 ms 256 KB Time limit exceeded
6 Execution timed out 1064 ms 256 KB Time limit exceeded
7 Execution timed out 1100 ms 256 KB Time limit exceeded
8 Execution timed out 1094 ms 632 KB Time limit exceeded
9 Execution timed out 1097 ms 632 KB Time limit exceeded
10 Execution timed out 1097 ms 632 KB Time limit exceeded