#include <bits/stdc++.h>
using namespace std;
int main(){
int n, d, m; cin >> n >> d >> m;
vector<pair<int, int>> v;
for(int i=0; i<m; i++){
int a; cin >> a;
v.push_back({a, i+1});
}
sort(v.begin(), v.end());
int k = (m + n - 1) / n;
for(int i=0; i<m; i++){
int b = i + 1; int a = v[i].first;
k = max(k, (b + a + d - 1) / (a + d));
}
cout << k << "\n";
int ptr = 0;
for(int i=0; i<n; i++){
for(int j=0; j<k && ptr < m; j++){
cout << v[ptr].second << " ";
ptr++;
}
cout << 0 << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |