#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ifstream in("input.txt");
ofstream out("output.txt");
typedef long long ll;
int n,d,m;
pair<int,int> v[1000001];
bool funz(int k){
int p=1;
for(int i=0;i<m;i+=k){
for(int y=i;y<i+k;y++){
if(p>v[y].fi+d)return 0;
}
p++;
}
return 1;
}
int main(){
cin>>n>>d>>m;
for(int i=0;i<m;i++){
cin>>v[i].fi;
v[i].se=i;
}
sort(v,v+m);
int s=1;
int d=m;
int minn=1e9;
while(s<=d){
int k=(s+d)/2;
if(funz(k)){
minn=min(minn,k);
d=k-1;
}
else{
s=k+1;
}
}
cout<<minn<<endl;
for(int i=0;i<m;i+=minn){
for(int y=i;y<i+minn&&y<m;y++){
cout<<v[y].se+1<<" ";
}
cout<<"0 "<<endl;
}
for(int i=m/minn+min(1,m%minn);i<n;i++){
cout<<"0 "<<endl;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
74 ms |
2040 KB |
Output isn't correct |
2 |
Incorrect |
73 ms |
2168 KB |
Output isn't correct |
3 |
Incorrect |
73 ms |
2040 KB |
Output isn't correct |
4 |
Incorrect |
75 ms |
2040 KB |
Output isn't correct |
5 |
Incorrect |
73 ms |
2040 KB |
Output isn't correct |
6 |
Incorrect |
77 ms |
2188 KB |
Output isn't correct |
7 |
Incorrect |
73 ms |
2040 KB |
Output isn't correct |
8 |
Incorrect |
76 ms |
2136 KB |
Output isn't correct |
9 |
Incorrect |
322 ms |
2332 KB |
Output isn't correct |
10 |
Incorrect |
314 ms |
2436 KB |
Output isn't correct |
11 |
Incorrect |
65 ms |
2040 KB |
Output isn't correct |
12 |
Incorrect |
124 ms |
3940 KB |
Output isn't correct |
13 |
Incorrect |
188 ms |
5240 KB |
Output isn't correct |
14 |
Incorrect |
297 ms |
6864 KB |
Output isn't correct |
15 |
Incorrect |
306 ms |
8328 KB |
Output isn't correct |
16 |
Incorrect |
439 ms |
9736 KB |
Output isn't correct |
17 |
Incorrect |
509 ms |
11224 KB |
Output isn't correct |
18 |
Incorrect |
515 ms |
12792 KB |
Output isn't correct |
19 |
Incorrect |
812 ms |
14564 KB |
Output isn't correct |
20 |
Incorrect |
505 ms |
11496 KB |
Output isn't correct |