#include <bits/stdc++.h>
using namespace std;
int n,m,k,ans=0;
bool b[1000];
int main()
{
//freopen("lighting.in","r",stdin);
//freopen("lighting.out","w",stdout);
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m>>k;
memset(b,0,sizeof(b));
for(int i=0;i<m;i++)
{
int p;
cin>>p;
for(int j=p-k-1;j<p+k;j++)
b[j]=1;
}
for(int i=0;i<n;i++)
{
if(b[i]==0)
{
for(int j=i;j<n;j++)
{
if(b[j]==1)
{
int a=j-i-1;
ans+=(a/(2*k+1)+1);
for(int p=i;p<=j;p++)
{
b[p]=1;
}
break;
}
else
{
if(j==n-1)
{
int a=j-i;
ans+=(a/(2*k+1)+1);
for(int p=i;p<=j;p++)
{
b[p]=1;
}
break;
}
}
}
}
}
cout<<ans;
//fclose(stdin);
//fclose(stdout);
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
468 KB |
Output is correct |
| 3 |
Runtime error |
2 ms |
568 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 4 |
Incorrect |
2 ms |
588 KB |
Output isn't correct |
| 5 |
Incorrect |
2 ms |
648 KB |
Output isn't correct |
| 6 |
Incorrect |
2 ms |
648 KB |
Output isn't correct |
| 7 |
Correct |
2 ms |
740 KB |
Output is correct |
| 8 |
Incorrect |
2 ms |
740 KB |
Output isn't correct |
| 9 |
Runtime error |
3 ms |
740 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 10 |
Correct |
2 ms |
824 KB |
Output is correct |
