oj.uz

Submission #105919

# Submission time Handle Problem Language Result Execution time Memory
105919 2019-04-15T17:16:22 Z leonarda Telefoni (COCI17_telefoni) C++14
80 / 80
 22 ms 1024 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
typedef pair<int, int> pi;
typedef long long int lint;
const int inf = 0x3f3f3f3f;
const int maxn = 0;

int n, d, cnt;

int main ()
{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	cin >> n >> d;
	int tel = 0;
	for(int i = 0; i < n; ++i) {
		int x;
		cin >> x;
		if(x == 1) 
			tel = i;
		if(i - tel == d) {
			++cnt;
			tel = i;
		}
	}
	
	cout << cnt;

return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 17 ms 896 KB Output is correct
9 Correct 19 ms 936 KB Output is correct
10 Correct 22 ms 1024 KB Output is correct