# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
895481 | ByeWorld | 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 fi first
#define se second
#define pb push_back
using namespace std;
#define int long long
#define in int
typedef pair<int,in> pii;
int le = 0, ri = -1, sum = 0;
vector<in> find_subset(in l, in r, vector<in> w) {
vector <pii> ma; int n = (int)w.size();
for(in i=0; i<n; i++) ma.pb({w[i], i});
sort(ma.begin(), ma.end());
for(int i=0; i<n; i++){
while(ri+1 < n && sum < l){
ri++; sum += ma[ri].fi;
}
if(l<=sum && sum<=r){
le = i; break;
}
sum -= ma[i].fi;
}
vector <in> ans;
if(l<=sum && sum<=r)
for(in i=le; i<=ri; i++) ans.pb(ma[i].se);
sort(ans.begin(), ans.end());
return ans;
}