#include <bits/stdc++.h>
using namespace std;
int n,d,m,l,r,mid,ct;
pair <int,int> a[100005];
bool ok;
int main(){
ios::sync_with_stdio(false);
cin >> n >> d >> m;
for (int i=1;i<=m;i++){
cin >> a[i].first;
a[i].second=i;
}
sort(a+1,a+1+m);
l=1; r=m;
while (l < r){
mid=(l+r)/2; ct=0;
ok=true;
for (int i=1;i<=m;i+=mid){
ct++;
for (int j=i;j<=i+mid-1;j++){
if (a[j].first+d < ct)
ok=false;
}
}
if (ok)
r=mid;
else
l=mid+1;
}
cout << l << "\n";
for (int i=0;i<n;i++){
for (int j=i*l+1;j<=min(m,i*l+l);j++){
cout << a[j].second << " ";
}
cout << "0\n";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
21 ms |
2028 KB |
Output isn't correct |
2 |
Incorrect |
21 ms |
2156 KB |
Output isn't correct |
3 |
Incorrect |
21 ms |
2028 KB |
Output isn't correct |
4 |
Incorrect |
21 ms |
2028 KB |
Output isn't correct |
5 |
Incorrect |
21 ms |
2028 KB |
Output isn't correct |
6 |
Incorrect |
21 ms |
2028 KB |
Output isn't correct |
7 |
Incorrect |
21 ms |
2028 KB |
Output isn't correct |
8 |
Incorrect |
21 ms |
2028 KB |
Output isn't correct |
9 |
Incorrect |
33 ms |
2156 KB |
Output isn't correct |
10 |
Incorrect |
33 ms |
2156 KB |
Output isn't correct |
11 |
Incorrect |
36 ms |
2156 KB |
Output isn't correct |
12 |
Incorrect |
9 ms |
1772 KB |
Output isn't correct |
13 |
Incorrect |
9 ms |
1772 KB |
Output isn't correct |
14 |
Incorrect |
10 ms |
1772 KB |
Output isn't correct |
15 |
Incorrect |
9 ms |
1792 KB |
Output isn't correct |
16 |
Incorrect |
10 ms |
1792 KB |
Output isn't correct |
17 |
Incorrect |
11 ms |
1772 KB |
Output isn't correct |
18 |
Incorrect |
9 ms |
1772 KB |
Output isn't correct |
19 |
Incorrect |
12 ms |
2028 KB |
Output isn't correct |
20 |
Incorrect |
11 ms |
1772 KB |
Output isn't correct |