#include <iostream>
#include <algorithm>
using namespace std;
int n,i,x,last,sol,d;
int main (){
cin>>n>>d;
for (i=1;i<=n;i++){
cin>>x;
if (x){
last = i;
continue;
}
if (i-last == d){
sol++;
last = i;
}}
cout<<sol;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
75 ms |
888 KB |
Output is correct |
9 |
Correct |
75 ms |
888 KB |
Output is correct |
10 |
Correct |
75 ms |
860 KB |
Output is correct |