# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168918 | abil | Gift (IZhO18_nicegift) | C++14 | 2025 ms | 63868 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 fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
//#define int long long
using namespace std;
const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int INF = (0x3f3f3f3f);
int a[N];
set<pair<int,int > > s;
vector<pair<int,pair<int,int > > > vec;
main()
{
int n, k, sum = 0;
scanf("%d%d", &n, &k);
for(int i = 1;i <= n; i++){
scanf("%d", &a[i]);
sum += a[i];
s.insert({a[i], i});
}
if(sum % k != 0){
cout << -1;
return 0;
}
while(!s.empty()){
pair<int,int > x, y;
x = *s.begin();
s.erase(s.begin());
y = *s.begin();
s.erase(s.begin());
vec.pb({x.fr, {x.sc, y.sc}});
if(y.fr - x.fr > 0){
s.insert({y.fr - x.fr, y.sc});
}
}
cout << vec.size() << endl;
for(auto to : vec){
cout << to.fr << " " << to.sc.fr << " " << to.sc.sc << 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... |