# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341310 | _ani | Gift (IZhO18_nicegift) | C++17 | 1032 ms | 73524 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 <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
using ll = long long;
const int N = 1'000'002;
pair<ll,int> a[N];
priority_queue<pair<ll, int>> q;
vector<pair<ll, vector<int>>>ans;
int main()
{
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
{
ll x;
cin >> x;
q.push({ x, i });
}
while (!q.empty()) {
vector<int> cur;
if (q.size() < k)
{
cout << -1;
return 0;
}
for (int i = 0; i < k; i++)
{
a[i] = q.top();
cur.push_back(a[i].second);
q.pop();
}
for (int i = 0; i < k - 1; i++)
{
a[i].first -= a[k - 1].first;
if (a[i].first)q.push(a[i]);
}
ans.push_back({ a[k - 1].first,cur });
}
cout << ans.size() << '\n';
for (auto b: ans)
{
cout << b.first << ' ';
sort(b.second.begin(), b.second.end());
for (auto x : b.second)
cout << x + 1 << ' ';
cout << '\n';
}
return 0;
}
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... |