This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define ff first
#define ss second
#define pii pair<int, int>
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int n, k;
cin >> n >> k;
ll sm = 0;
pair<int, int> p[n];
for (int i = 0; i < n; i++) {
cin >> p[i].ff; p[i].ss = i;
sm += p[i].ff;
}
if (sm % k) return cout << -1, 0;
cout << sm / k << '\n';
assert(false);
while (p[n - 1].ff) {
sort(p, p + n);
cout << "1 ";
for (int i = n - 1; i >= n - k; i--) {
assert(p[i].ff);
p[i].ff--;
cout << p[i].ss + 1 << ' ';
}
cout << '\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |