# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
93284 | SamAnd | Gift (IZhO18_nicegift) | C++17 | 2054 ms | 352292 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 = 1000006;
struct ban
{
int i;
long long x;
ban(){}
ban(int i, long long x)
{
this->i = i;
this->x = x;
}
};
bool operator<(const ban& a, const ban& b)
{
return a.x < b.x;
}
int n, k;
long long a[N];
void solv1()
{
vector<vector<long long> > ans;
priority_queue<ban> q;
for (int i = 1; i <= n; ++i)
q.push(ban(i, a[i]));
bool z = false;
while (1)
{
if (q.size() == 0)
{
z = true;
break;
}
if (q.size() < k)
break;
vector<ban> v;
for (int ii = 0; ii < k; ++ii)
{
v.push_back(q.top());
q.pop();
}
long long minu = v[0].x;
for (int i = 1; i < k; ++i)
minu = min(minu, v[i].x);
minu = 1;
vector<long long> vv;
vv.push_back(minu);
for (int i = 0; i < k; ++i)
{
v[i].x -= minu;
if (v[i].x)
q.push(v[i]);
vv.push_back(v[i].i);
}
ans.push_back(vv);
}
if (!z)
{
printf("-1\n");
return;
}
printf("%d\n", ans.size());
for (int i = 0; i < ans.size(); ++i)
{
for (int j = 0; j < ans[i].size(); ++j)
printf("%lld ", ans[i][j]);
printf("\n");
}
}
int main()
{
//freopen("input2.txt", "r", stdin);
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%lld", &a[i]);
solv1();
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... |