# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171135 | juggernaut | Gift (IZhO18_nicegift) | C++14 | 2043 ms | 147720 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.
//Just try and the idea will come!
#include<bits/stdc++.h>
#define int long long int
using namespace std;
priority_queue<pair<int,int>>q;
int n,k,i,x;
pair<int,int>a,b;
vector<pair<int,int>>ans;
main(){
scanf("%lld%lld",&n,&k);
for(i=0;i<n;i++){
scanf("%lld",&x);
q.push({x,i+1});
}
while(!q.empty()){
if(q.size()==1){
puts("-1");
return 0;
}
a=q.top();
q.pop();
b=q.top();
q.pop();
ans.push_back({b.second,a.second});
if(a.first!=1)q.push({a.first-1,a.second});
if(b.first!=1)q.push({b.first-1,b.second});
}
for(auto res:ans)printf("1 %lld %lld\n",res.first,res.second);
}
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... |