# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883320 | marcid | 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.
#include <bits/stdc++.h>
#define int long long
#define ii pair<int,int>
#define iii tuple<int,int,int>
#define vb vector<bool>
#define vi vector<int>
#define vii vector<ii>
#define viii vector<iii>
#define pb push_back
#define eb emplace_back
#define all(v) v.begin(),v.end()
using namespace std;
vi find_subset(int l, int u, vi w) {
int n = w.size();
vii a(n);
for (int i = 0; i < n; i++) {
a[i]={w[i],i};
} set<int> st; map<int,int> pos; int sum = 0; st.insert(0); pos[0]=-1;
sort(a.begin(),a.end());
for (int i = 0; i < n; i++) {
sum+=a[i].first;
auto it = *st.lower_bound(sum-u);
if (it <= sum-l) {
vi ans;
for (int j = pos[it]+1; j < n; j++) {
ans.pb(a[j].second);
} return ans;
} st.insert(sum);
pos[sum] = i;
}
return {};
}