#include<bits/stdc++.h>
using namespace std;
const int N = (int)1e6+7;
int n, k, a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
long long tot = 0;
int mx = 0;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
tot += a[i];
mx = max(mx, a[i]);
}
if(tot%k) {
cout << "-1\n";
return 0;
}
if(mx>tot/k) {
cout << "-1\n";
return 0;
}
set<pair<int, int> > s;
for(int i = 1; i <= n; ++i) {
s.insert({a[i], i});
}
vector<vector<long long> > ans;
while(!s.empty()) {
vector<int> cur;
for(int j = 0; j < k; ++j) {
auto it = --s.end();
cur.push_back(it->second);
s.erase(it);
}
int can = 1;
if(!s.empty()) {
can = (--s.end())->first;
}
can = a[cur.back()]-can+1;
vector<long long> 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.insert({a[id], id});
}
}
}
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 |
344 KB |
n=4 |
2 |
Correct |
0 ms |
348 KB |
n=3 |
3 |
Correct |
0 ms |
352 KB |
n=3 |
4 |
Correct |
1 ms |
348 KB |
n=4 |
5 |
Correct |
0 ms |
348 KB |
n=4 |
6 |
Correct |
0 ms |
348 KB |
n=2 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
n=4 |
2 |
Correct |
0 ms |
348 KB |
n=3 |
3 |
Correct |
0 ms |
352 KB |
n=3 |
4 |
Correct |
1 ms |
348 KB |
n=4 |
5 |
Correct |
0 ms |
348 KB |
n=4 |
6 |
Correct |
0 ms |
348 KB |
n=2 |
7 |
Correct |
1 ms |
348 KB |
n=5 |
8 |
Correct |
1 ms |
348 KB |
n=8 |
9 |
Correct |
4 ms |
1116 KB |
n=14 |
10 |
Correct |
3 ms |
856 KB |
n=11 |
11 |
Correct |
21 ms |
6436 KB |
n=50000 |
12 |
Correct |
28 ms |
7184 KB |
n=50000 |
13 |
Correct |
12 ms |
1808 KB |
n=10 |
14 |
Correct |
24 ms |
3080 KB |
n=685 |
15 |
Correct |
35 ms |
3328 KB |
n=623 |
16 |
Correct |
14 ms |
2068 KB |
n=973 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
n=4 |
2 |
Correct |
0 ms |
348 KB |
n=3 |
3 |
Correct |
0 ms |
352 KB |
n=3 |
4 |
Correct |
1 ms |
348 KB |
n=4 |
5 |
Correct |
0 ms |
348 KB |
n=4 |
6 |
Correct |
0 ms |
348 KB |
n=2 |
7 |
Correct |
1 ms |
348 KB |
n=5 |
8 |
Correct |
1 ms |
348 KB |
n=8 |
9 |
Correct |
4 ms |
1116 KB |
n=14 |
10 |
Correct |
3 ms |
856 KB |
n=11 |
11 |
Correct |
21 ms |
6436 KB |
n=50000 |
12 |
Correct |
28 ms |
7184 KB |
n=50000 |
13 |
Correct |
12 ms |
1808 KB |
n=10 |
14 |
Correct |
24 ms |
3080 KB |
n=685 |
15 |
Correct |
35 ms |
3328 KB |
n=623 |
16 |
Correct |
14 ms |
2068 KB |
n=973 |
17 |
Correct |
23 ms |
3080 KB |
n=989 |
18 |
Correct |
10 ms |
1368 KB |
n=563 |
19 |
Correct |
15 ms |
1880 KB |
n=592 |
20 |
Correct |
16 ms |
1884 KB |
n=938 |
21 |
Correct |
18 ms |
1372 KB |
n=747 |
22 |
Correct |
13 ms |
1724 KB |
n=991 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
7 ms |
468 KB |
Jury has the answer but participant has not |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
n=4 |
2 |
Correct |
0 ms |
348 KB |
n=3 |
3 |
Correct |
0 ms |
352 KB |
n=3 |
4 |
Correct |
1 ms |
348 KB |
n=4 |
5 |
Correct |
0 ms |
348 KB |
n=4 |
6 |
Correct |
0 ms |
348 KB |
n=2 |
7 |
Correct |
1 ms |
348 KB |
n=5 |
8 |
Correct |
1 ms |
348 KB |
n=8 |
9 |
Correct |
4 ms |
1116 KB |
n=14 |
10 |
Correct |
3 ms |
856 KB |
n=11 |
11 |
Correct |
21 ms |
6436 KB |
n=50000 |
12 |
Correct |
28 ms |
7184 KB |
n=50000 |
13 |
Correct |
12 ms |
1808 KB |
n=10 |
14 |
Correct |
24 ms |
3080 KB |
n=685 |
15 |
Correct |
35 ms |
3328 KB |
n=623 |
16 |
Correct |
14 ms |
2068 KB |
n=973 |
17 |
Correct |
23 ms |
3080 KB |
n=989 |
18 |
Correct |
10 ms |
1368 KB |
n=563 |
19 |
Correct |
15 ms |
1880 KB |
n=592 |
20 |
Correct |
16 ms |
1884 KB |
n=938 |
21 |
Correct |
18 ms |
1372 KB |
n=747 |
22 |
Correct |
13 ms |
1724 KB |
n=991 |
23 |
Incorrect |
7 ms |
468 KB |
Jury has the answer but participant has not |
24 |
Halted |
0 ms |
0 KB |
- |