#include<bits/stdc++.h>
using namespace std;
const int N = (int)1e6+7;
int n, k;
long long a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
long long tot = 0;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
tot += a[i];
}
priority_queue<pair<long long, int> > s;
for(int i = 1; i <= n; ++i) {
s.push({a[i], i});
}
vector<vector<long long> > ans;
vector<long long> v;
while((int)s.size()>=k) {
vector<int> cur;
for(int j = 0; j < k; ++j) {
cur.push_back(s.top().second);
s.pop();
}
int can = 1;
if(!s.empty()) {
can = s.top().first;
}
can = a[cur[0]]-can+1;
v = {can};
for(auto id : cur) {
assert(a[id]>=can);
v.push_back(id);
}
ans.push_back(v);
for(auto id : cur) {
a[id] -= can;
if(a[id]>0) {
s.push({a[id], id});
}
}
}
if(!s.empty()) {
cout << "-1\n";
return 0;
}
cout << (int)ans.size() << "\n";
for(auto x : ans) {
for(auto y : x) {
cout << y << ' ';
}
cout << "\n";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
n=4 |
2 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
n=4 |
2 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
n=4 |
2 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2043 ms |
384228 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
n=4 |
2 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |