oj.uz

Submission #251679

# Submission time Handle Problem Language Result Execution time Memory
251679 2020-07-22T07:14:22 Z Vladikus004 Rasvjeta (COCI17_rasvjeta) C++14
45 / 50
 1 ms 384 KB 
#include <bits/stdc++.h>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;

const int N = 1000 + 3;
int n, m, k, a[N], ans, sz = k * 2 + 1;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
    #endif // LOCAL
    cin >> n >> m >> k;
    sz = k * 2 + 1;
    for (int i = 0; i < m; i++)
        cin >> a[i];
    for (int i = 1; i < m; i++){
        ans += max(0, (a[i] - a[i - 1] - 1 - 2 * k + sz - 1) / sz);
    }
    ans += max(0,(a[0] - k + sz - 1) / sz);
    ans += max(0,(n - a[m-1] - k + sz - 1) / sz);
    cout << ans;
}

Subtask #1
45.0 / 50.0

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