# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338537 | boykut | Gift (IZhO18_nicegift) | C++14 | 321 ms | 30800 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;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector <int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
priority_queue < pair<int, int> > q;
for (int i = 0; i < n; i++) {
q.push({a[i], 1+i});
}
if (k != 2) return 0;
vector<tuple<int,int,int>> res;
while (!q.empty()) {
if (q.size() >= 2) {
auto a = q.top(); q.pop();
auto b = q.top(); q.pop();
res.push_back(make_tuple(b.first, a.second, b.second));
if (a.first > b.first)
q.push({a.first-b.first, a.second});
} else if (q.size() == 1) {
return cout << "-1\n", 0;
}
}
cout << res.size() << '\n';
for (int i = 0; i < res.size(); i++) {
cout << get<0>(res[i]) << ' ' << get<1>(res[i]) << ' ' << get<2>(res[i]) << '\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... |