| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 475367 | Ahmed57 | Rasvjeta (COCI17_rasvjeta) | C++14 | 1 ms | 204 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()
{
    int n,m,k;
    cin>>n>>m>>k;
    int arr[m+2];arr[0] = 1-k;
    for(int i = 1;i<=m;i++){
        cin>>arr[i];
    }arr[m+1] = n;
    sort(arr,arr+m);
    int sum = 0;int z = ((k*2)+1);
    for(int i = 1;i<=m;i++){
        int u = arr[i]-k;
        int r = arr[i-1]+k;
        if(((u-r))>0){
            int o = ((u-r))/z;
            if(((u-r))%z!=0)o++;
            sum+=max(o,0);
        }
    }
    int u = n;
    int r = arr[m]+k;
    if(((u-r))>0){
        int o = ((u-r))/z;
        if(((u-r))%z!=0)o++;
        sum+=max(o,0);
    }
    cout<<sum<<"\n";
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
