oj.uz

Submission #585228

# Submission time Handle Problem Language Result Execution time Memory
585228 2022-06-28T12:55:38 Z nguyen31hoang08minh2003 Telefoni (COCI17_telefoni) C++14
80 / 80
 18 ms 1184 KB 
#include <bits/stdc++.h>
#define fore(i, a, b) for (int i = (a), i##_last = (b); i < i##_last; ++i)
#define fort(i, a, b) for (int i = (a), i##_last = (b); i <= i##_last; ++i)
#define ford(i, a, b) for (int i = (a), i##_last = (b); i >= i##_last; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;

template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};

typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

const int maxN = 300005;

int n, d, res;
bool telephone[maxN];

int main() {
    #ifdef LOCAL
        freopen("input.INP", "r", stdin);
    #endif // LOCAL
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);
    cin >> n >> d;
    fort(i, 1, n)
        cin >> telephone[i];
    for (int i = 1, j = 1; i <= n; ++i) {
        if (telephone[i]) {
            maxi(j, min(n, i + d - 1));
            continue;
        }
        if (j < i) {
            ++res;
            maxi(j, min(n, i + d - 1));
        }
    }
    cout << res << '\n';
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 17 ms 1100 KB Output is correct
9 Correct 18 ms 1184 KB Output is correct
10 Correct 18 ms 1100 KB Output is correct