# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40451 | szawinis | Gift (IZhO18_nicegift) | C++14 | 206 ms | 28136 KiB |
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;
const int N = 1e6+1;
int n, k, a[N];
vector<int> ls[N];
int main() {
scanf("%d %d", &n, &k);
int sum = 0;
for(int i = 0; i < n; i++) scanf("%d", a+i), sum += a[i];
if(sum % k) printf("-1"), exit(0);
priority_queue<pair<int,int> > pq;
for(int i = 0; i < sum / k; i++) pq.emplace(k, i);
for(int i = 0; i < n; i++) {
unordered_set<int> mark;
for(int j = 0; j < a[i]; j++) {
assert(!pq.empty());
auto curr = pq.top();
pq.pop();
--curr.first;
if(mark.count(curr.second)) printf("-1"), exit(0);
ls[curr.second].push_back(i);
pq.push(curr);
mark.insert(curr.second);
}
}
printf("%d\n", sum / k);
for(int i = 0; i < sum / k; i++) {
assert(ls[i].size() == k);
printf("1 ");
for(int idx: ls[i]) printf("%d ", idx+1);
printf("\n");
}
}
Compilation message (stderr)
# | 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... |