oj.uz

답안 #109209

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
109209 2019-05-05T13:59:55 Z Frankenween Telefoni (COCI17_telefoni) C++17
80 / 80
 32 ms 3376 KB 
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#define ull unsigned long long
#define pll pair<ll, ll>
#define mp make_pair
#define ll long long
#define pb push_back
#define deb(x) cout << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define ld long double
const ll mod1 = (ll)1e9 + 7;
const ll mod2 = (ll)1e9 + 9;
const ll BASE = 47;
const ll inf = (ll)1e18;
const long double e = 2.718281828459;
const long double pi = 3.141592653;
const ld EPS = 1e-9;


using namespace std;


template <class T>
istream& operator>>(istream &in, vector<T> &arr) {
    for (T &cnt : arr) {
        in >> cnt;
    }
    return in;
};


void solve() {
    ll n, d;
    cin >> n >> d;
    vector<ll> arr(n);
    cin >> arr;
    ll r = d;
    ll answer = 0;
    ll i = 0;
    while (i < n) {
        if (arr[i] == 1) {
            r = i + d;
            i++;
            continue;
        }
        if (i == r) {
            answer++;
            r = i + d;
            continue;
        }
        i++;
    }
    cout << answer;
}


int main() {
#ifndef LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#else
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cout.precision(30);
    ll seed = time(0);
    //cerr << "Seed: " << seed << "\n";
    srand(seed);
    solve();
    return 0;
}

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 20 ms 3328 KB Output is correct
9 Correct 32 ms 3376 KB Output is correct
10 Correct 24 ms 3328 KB Output is correct