# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
312236 | aryan12 | Gift (IZhO18_nicegift) | C++17 | 33 ms | 12780 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;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
int f = 1, s = 2;
vector<pair<int, pair<int, int> > >ans;
while(f <= n && s <= n) {
if(a[f] > a[s]) {
a[f] -= a[s];
ans.push_back({a[s], {f, s}});
s = max(s, f) + 1;
}
else if(a[f] == a[s]) {
ans.push_back({a[f], {f, s}});
f = max(s, f) + 1;
s = f + 1;
}
else {
a[s] -= a[f];
ans.push_back({a[f], {f, s}});
f = max(s, f) + 1;
}
}
if(f <= n || s <= n) {
cout << "-1" << endl;
}
else {
cout << ans.size() << endl;
for(int i = 0; i < ans.size(); i++) {
cout << ans[i].first << " " << ans[i].second.first << " " << ans[i].second.second << endl;
}
}
}
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... |