Submission #1183934

#	Time	Username	Problem	Language	Result	Execution time	Memory
1183934		nagorn_ph	Telefoni (COCI17_telefoni)	C++20	80 / 80	8 ms	328 KiB

telefoni

#include <bits/stdc++.h>
#define int long long
#define double long double
#define pii pair <int,int>
#define tiii tuple <int, int, int>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define ub(a, b) upper_bound(a.begin(), a.end(), b) - a.begin()
#define lb(a, b) lower_bound(a.begin(), a.end(), b) - a.begin()
#define ve vector
#define graph(a, n) vector <int> a[n];
#define wgraph(a, n) vector <pii> a[n];
#define emb emplace_back
#define em emplace
#define ins insert
#define er erase
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)

using namespace std;

template <typename T>
using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;

const int mod = 1e9 + 7;
const int inf = 1e18;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int32_t main(){
    iShowSpeed;
    int n, k; cin >> n >> k;
    int curr = 1, ans = 0;
    for (int i = 1; i <= n; i++) {
        int a; cin >> a; if (a) curr = i;
        if (i - curr >= k) {
            curr = i;
            ans++;
        }
    }
    cout << ans;
}

• Subtask 1: 80 / 80