| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 98099 | dalgerok | Rasvjeta (COCI17_rasvjeta) | C++17 | 3 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>
using namespace std;
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    int a[n + 5];
    memset(a, 0, sizeof(a));
    for(int i = 1; i <= m; i++){
        int x;
        cin >> x;
        a[max(1, x - k)] += 1;
        a[min(n + 1, x + k + 1)] -= 1;
    }
    int cur = 0, ans = 0;
    for(int i = 1; i <= n; i++){
        cur += a[i];
        if(cur == 0){
            ans += 1;
            cur += 1;
            a[min(n + 1, i + 2 * k + 1)] -= 1;
        }
    }
    cout << ans;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
