| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 251680 | Vladikus004 | Rasvjeta (COCI17_rasvjeta) | C++14 | 1 ms | 384 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define inf 2e9
#define int long long
#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;
int32_t 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(0LL, (a[i] - a[i - 1] - 1 - 2 * k + sz - 1) / sz);
    }
    ans += max(0LL,(a[0] - 1 - k + sz - 1) / sz);
    ans += max(0LL,(n - a[m-1] - k + sz - 1) / sz);
    cout << ans;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
