#include <iostream>
#include <algorithm>
using namespace std;
int v[10000];
int n,m;
bool verf(int mij){
int z=m-1,i=1;
z=0;i=1;
while(z<m-1 && i<=n){
z=min(z+mij,m-1);
if(i>v[z])
break;
i++;
}
if(z<m-1 && i<=n)
return 0;
else
return 1;
}
int main()
{
int st,dr,mij,d,rasp,i,vf;
cin>>n>>d>>m;
for(i=0;i<m;i++){
cin>>v[i];
v[i]+=d;
}
sort(v,v+m);
st=1;dr=1000000;rasp=mij=0;
while(st<=dr){
mij=(st+dr)/2;
vf=verf(mij);
if(vf==1){
rasp=mij;
dr=mij-1;
}else{
st=mij+1;
}
}
cout<<rasp;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
572 KB |
Execution killed with signal 11 |
2 |
Runtime error |
5 ms |
596 KB |
Execution killed with signal 11 |
3 |
Runtime error |
3 ms |
596 KB |
Execution killed with signal 11 |
4 |
Runtime error |
3 ms |
596 KB |
Execution killed with signal 11 |
5 |
Runtime error |
3 ms |
556 KB |
Execution killed with signal 11 |
6 |
Runtime error |
3 ms |
596 KB |
Execution killed with signal 11 |
7 |
Runtime error |
3 ms |
596 KB |
Execution killed with signal 11 |
8 |
Runtime error |
3 ms |
552 KB |
Execution killed with signal 11 |
9 |
Runtime error |
2 ms |
576 KB |
Execution killed with signal 11 |
10 |
Runtime error |
3 ms |
596 KB |
Execution killed with signal 11 |
11 |
Runtime error |
3 ms |
596 KB |
Execution killed with signal 11 |
12 |
Runtime error |
3 ms |
576 KB |
Execution killed with signal 11 |
13 |
Runtime error |
4 ms |
596 KB |
Execution killed with signal 11 |
14 |
Runtime error |
4 ms |
680 KB |
Execution killed with signal 11 |
15 |
Runtime error |
3 ms |
576 KB |
Execution killed with signal 11 |
16 |
Runtime error |
4 ms |
724 KB |
Execution killed with signal 11 |
17 |
Runtime error |
3 ms |
724 KB |
Execution killed with signal 11 |
18 |
Runtime error |
3 ms |
596 KB |
Execution killed with signal 11 |
19 |
Runtime error |
3 ms |
596 KB |
Execution killed with signal 11 |
20 |
Runtime error |
4 ms |
700 KB |
Execution killed with signal 11 |