# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1185665 | nikaa123 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<int> find_subset(int l, int u, vector<int> a) {
int n = a.size();
vector <pair<int,int>> w;
w.insert(w.begin(),{0,0});
for (int i = 0; i < n; i++) {
w.push_back({a[i],i});
}
sort(w.begin(),w.end());
int pref[n+5],suff[n+5];
pref[0]=suff[0]=0;
for (int i = 1; i <= n; i++) {
pref[i] = pref[i-1] + w[i].first;
}
for (int i = n; i >= 1; i--) {
suff[n-i+1] = suff[n-i]+w[i].first;
}
int k=-9,p;
for (int i = 1; i <= n; i++) {
if (pref[i] <= u && suff[i] >= l) {
k = i;
break;
}
}
if (k==-9) return vector<int>(0);
for (int i = 0; i <= k; i++) {
int num = pref[i]+suff[k-i];
if (l <= num && num <= u) {
p = i;
break;
}
}
vector <int> v;
for (int i = 1; i <= p; i++) {
v.push_back(w[i].second);
}
for (int i = n; i >= n-k+p+1; i--) {
v.push_back(w[i].second);
}
sort(v.begin(),v.end());
return v;
}