oj.uz

Submission #236718

# Submission time Handle Problem Language Result Execution time Memory
236718 2020-06-03T06:40:14 Z VEGAnn Rasvjeta (COCI17_rasvjeta) C++14
50 / 50
 5 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
bool mrk[N];
int n, m, k, ans = 0;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m >> k;

    for (int i = 0; i < m; i++){
        int x; cin >> x;

        for (int j = max(1, x - k); j <= min(n, x + k); j++)
            mrk[j] = 1;
    }

    for (int i = 1; i <= n; i++){
        if (mrk[i]) continue;

        ans++;

        for (int j = i; j <= min(n, i + k + k); j++)
            mrk[j] = 1;
    }

    cout << ans;

    return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct