Submission #475369

#TimeUsernameProblemLanguageResultExecution timeMemory
475369Ahmed57Rasvjeta (COCI17_rasvjeta)C++14
50 / 50
1 ms204 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,m,k;
    cin>>n>>m>>k;
    int arr[m+2];arr[0] = 0-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)-1)>0){
            int o = ((u-r)-1)/z;
            if(((u-r)-1)%z!=0)o++;
            sum+=max(o,0);
        }
    }
    int u = n+1;
    int r = arr[m]+k;
    if(((u-r)-1)>0){
        int o = ((u-r)-1)/z;
        if(((u-r)-1)%z!=0)o++;
        sum+=max(o,0);
    }
    cout<<sum<<"\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...