# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
878888 | Gray | Detecting Molecules (IOI16_molecules) | C++17 | 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.
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
#include <cassert>
#define ll long long
#define ln "\n"
#define ff first
#define ss second
#define ld long double
const ll INF = 2e18;
const ll MOD = 1e9+7;
using namespace std;
int find_subset(int l, int u, int w[], int n, int result[]){
vector<pair<ll, ll>> bw(n);
for (ll i=0; i<n; i++){
bw[i] = {w[i], i};
}
sort(bw.rbegin(), bw.rend());
vector<ll> ind;
ll sum = 0;
ll cp = 0;
while (cp<n and sum+bw[cp].ff<=u){
ind.push_back(bw[cp].ss);
sum+=bw[cp].ff;
cp++;
}
ll ccp = n-1;
while (ccp>cp and sum+bw[ccp].ff<=l){
ind.push_back(bw[ccp].ss);
sum+=bw[ccp].ff;
ccp--;
}
if (sum>=l and sum<=u){
for (ll i=0; i<(int)ind.size(); i++){
result[i] = (int)(ind[i]);
}
return (int)ind.size();
}else return 0;
}