# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
644134 | Do_you_copy | Gift (IZhO18_nicegift) | C++17 | 0 ms | 0 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>#define int long long#define fi first#define se secondusing namespace std;using ll = long long;using pii = pair <int, int>;#define pb push_backconst int maxN = 1e6 + 10;const int maxOP = 3e6;int n, k;int a[maxN];priority_queue <pii> PQ;vector <vector <int>> e;void Init(){ cin >> n >> k; for (int i = 1; i <= n; ++i){ cin >> a[i]; PQ.push({a[i], i}); } for (int i = 1; i * k <= maxOP; ++i){ vector <int> pos; for (int j = 0; j < k; ++j){ pos.pb(PQ.top().se); PQ.pop(); } if (!a[pos.back()]) break; e.pb({a[pos.back()]}); for (int j = 0; j < k; ++j){ e.back().pb(pos[j]); a[pos[j]] -= a[pos.back()]; } for (int j = 0; j < k; ++j){ PQ.push({a[pos[j]], pos[j]}); } } for (int i = 1; i <= n; ++i){ if (a[i]){ cout << -1; return; } } cout << e.size() << "\n"; for (auto &i: e){ for (auto &j: i) cout << j << " "; cout << "\n"; }}signed main() { Init();}