#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,dk,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++){
p=max(p,v[y].fi);
if(p>v[y].fi+dk)return 0;
}
p++;
}
return 1;
}
int main(){
cin>>n>>dk>>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 |
Expected EOLN |
2 |
Incorrect |
74 ms |
2040 KB |
Expected EOLN |
3 |
Incorrect |
74 ms |
2040 KB |
Expected EOLN |
4 |
Incorrect |
74 ms |
2044 KB |
Expected EOLN |
5 |
Incorrect |
75 ms |
2040 KB |
Expected EOLN |
6 |
Incorrect |
74 ms |
2044 KB |
Expected EOLN |
7 |
Incorrect |
79 ms |
2024 KB |
Expected EOLN |
8 |
Incorrect |
75 ms |
2068 KB |
Expected EOLN |
9 |
Incorrect |
318 ms |
2184 KB |
Output isn't correct |
10 |
Incorrect |
316 ms |
2264 KB |
Output isn't correct |
11 |
Incorrect |
64 ms |
1912 KB |
Output isn't correct |
12 |
Incorrect |
129 ms |
3768 KB |
Output isn't correct |
13 |
Incorrect |
188 ms |
5180 KB |
Output isn't correct |
14 |
Incorrect |
311 ms |
6868 KB |
Output isn't correct |
15 |
Incorrect |
313 ms |
8236 KB |
Output isn't correct |
16 |
Incorrect |
441 ms |
9768 KB |
Output isn't correct |
17 |
Incorrect |
508 ms |
11304 KB |
Output isn't correct |
18 |
Incorrect |
581 ms |
13084 KB |
Output isn't correct |
19 |
Incorrect |
824 ms |
14896 KB |
Output isn't correct |
20 |
Incorrect |
511 ms |
11352 KB |
Output isn't correct |