// ###
// #---##
// ####-0----##
// ####--------#
// #--------#
// ##-------#
// #-------#
// #-------#
// ##--------#
// #---------# #####
// #-------##-------####### Ya katala
// #------#----------------#
// #------##-----------------#
// #------##------------------#
// #-----#---------------------#
// #-----##---------------------#
// #------##--------------------#
// #-------##-------------------#
// #--------##------------------#
// ############################ #
// || ||
// || ||
// || ||
// || ||
// ####| ####|
#include <bits/stdc++.h>
#include <iostream>
#define for0(i , v) for (int i = 0 ; i < v.size() ; i++)
#define for1(i , n) for (int i = 1 ; i <= n ; i++)
#define AIDS ios_base::sync_with_stdio(0)
#define pb push_back
#define pp pop_back
#define sz(a) a.size()
#define all(x) x.begin() , x.end()
#define F first
#define S second
#define mp make_pair
#define ld long double
#define ll long long
#define pii pair<int, int>
#define in insert
#define vi vector <int>
#define vvi vector <vi>
#define Case "Case " << num << ": "
const int N = 1e6 + 3;
const ll INF = 1e18 + 100;
const int inf = 1e9 + 123;
const int MOD = 1e9 + 7;
const int dx[] = {0 , 1 , 0 , -1 , 0};
const int dy[] = {0 , 0 , 1 , 0 , -1};
const char dd[] = {' ' , 'D' , 'R' , 'U' , 'L'};
using namespace std;
int a[N];
main () {
// freopen("input.in", "r", stdin);
// freopen("output.out", "w", stdout);
AIDS;
int n , d;
cin >> n >> d;
for (int i = 1 ; i <= n ; i++) {
cin >> a[i];
}
int dis = 0 , ans = 0;
for (int i = 1 ; i <= n ; i++) {
if (!a[i]) {
dis++;
}
else {
dis = 0;
}
if (dis == d) {
a[i] = 1;
dis = 0;
ans++;
}
}
cout << ans;
}
Compilation message
telefoni.cpp:63:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main () {
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
448 KB |
Output is correct |
4 |
Correct |
2 ms |
524 KB |
Output is correct |
5 |
Correct |
2 ms |
524 KB |
Output is correct |
6 |
Correct |
2 ms |
728 KB |
Output is correct |
7 |
Correct |
2 ms |
728 KB |
Output is correct |
8 |
Correct |
26 ms |
1772 KB |
Output is correct |
9 |
Correct |
60 ms |
1772 KB |
Output is correct |
10 |
Correct |
24 ms |
1772 KB |
Output is correct |