Submission #1166417

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166417		sunflower	Telefoni (COCI17_telefoni)	C++17	80 / 80	13 ms	584 KiB

telefoni

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define SZ(x) ((int) (x).size())
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(x) cerr << "[" << #x << " = " << (x) << "]" << endl

#define left    __left
#define right   __right
#define prev    __prev
#define fi      first
#define se      second

template <class X, class Y>
    bool maximize(X &x, Y y) {
        if (x < y) return x = y, true;
        else return false;
    }

template <class X, class Y>
    bool minimize(X &x, Y y) {
        if (x > y) return x = y, true;
        else return false;
    }

int numTable, maxDist;

#define MAX_N 300'300
bool a[MAX_N + 2];

int main() {
    ios_base::sync_with_stdio(false);cin.tie(nullptr);
    cin >> numTable >> maxDist;
    FOR(i, 1, numTable) cin >> a[i];

    assert(a[1] == 1);

    int ans = 0;
    if (a[numTable] == 0) a[numTable] = 1, ++ans;

    int lastPos = 1;
    FOR(j, 2, numTable) {
        if (j - lastPos > maxDist) ++ans, lastPos = j - 1;
        if (a[j] == 1) lastPos = j;
    }

    cout << ans;

    return 0;
}

/* Discipline - Calm */

• Subtask 1: 80 / 80