| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 475388 | Ahmed_Solyman | Rasvjeta (COCI17_rasvjeta) | C++14 | 2 ms | 332 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;
typedef long long ll;
int main()
{
    ll n,m,k;cin>>n>>m>>k;
    map<ll,bool>vis;
    while(m--){
        ll x;cin>>x;
        for(ll i=x-k;i<=x+k;i++)vis[i]=1;
    }
    ll ans=0;
    for(ll i=1;i<=n;i++){
        if(!vis[i]){
            for(ll j=i+k;j>=i;j--)vis[j]=1;
            for(ll j=i+k;j<=i+k*2;j++)vis[j]=1;
            ans++;
        }
    }
    cout<<ans<<endl;
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
