# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
139454 | medk | Detecting Molecules (IOI16_molecules) | C++14 | 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 "molecules.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define x first
#define y second
using namespace std;
vector<int> find_subset(int l, int u, vector<ll> w)
{
vector<pair<ll,int>> pw;
for(ll x:w) pw.pb({x,int(pw.size())});
sort(pw.begin(),pw.end());
ll sum=0;
int ptr=0;
vector<int> ans;
bool flag=0;
while(ptr<pw.size())
{
if(sum+pw[ptr].x<l) sum+=pw[ptr].x, flag=1;
else if(sum+pw[ptr].x<=u)
{
ans.pb(pw[ptr].y);
return ans;
}
else break;
ans.pb(pw[ptr].y);
ptr++;
}
if(!flag) return {};
for(int i=0;i<ans.size() && pw.size()-1-i>=ans.size();i++)
{
sum+=pw[pw.size()-1-i].x-pw[i].x;
ans[i]=pw[pw.size()-1-i].y;
if(sum>=l) return ans;
}
return {};
}