#include <bits/stdc++.h>
#define ll long long
#define S second
#define F first
#define PB push_back
#define PF push_front
using namespace std;
signed main()
{
int n , m;
cin >> n >> m;
int res = 0;
int cnt = 1;
for(int i = 0; i < n; i++){
int x;
cin >> x;
if( x == 0 && cnt < m){
cnt++;
}
else if(x == 0){
res++;
cnt = 1;
}
}
cout<< res;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
8 |
Incorrect |
30 ms |
852 KB |
Output isn't correct |
9 |
Incorrect |
31 ms |
856 KB |
Output isn't correct |
10 |
Incorrect |
31 ms |
1000 KB |
Output isn't correct |