# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233645 | 2020-05-21T09:13:53 Z | triple_fault | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#include "molecules.h" using namespace std; #define ll long long std::vector<int> find_subset(int l, int u, std::vector<int> w) { ll n = (ll)w.size(); vector<ll> ps(n); vector<ll> vals(n); for (ll i = 0; i < n; ++i) vals[i] = (ll)w[i]; ll L = (ll)l, R = (ll)u; sort(vals.begin(), vals.end()); ps[0] = vals[0]; for (ll i = 1; i < n; ++i) ps[i] = ps[i - 1] + vals[i]; for (ll i = 0; i < n; ++i) { ll xprev = 0; if (i) xprev = ps[i - 1]; ll xmin = xprev + L, xmax = xprev + R; ll lm = n, rm = n; ll left = i, right = n - 1; while (left <= right) { ll mid = (left + right) / 2; if (ps[mid] >= xmin) { lm = mid; right = mid - 1; } else left = mid + 1; } left = i, right = n - 1; while (left <= right) { ll mid = (left + right) / 2; if (ps[mid] >= (xmax + 1)) { rm = mid; right = mid - 1; } else left = mid + 1; } if (lm < n && (rm - lm) > 0) { ll fst = lm, lst = rm - 1; vector<int> ret; for (ll j = i; j <= fst; ++j) ret.push_back((int)j); return ret; } } return vector<int>(0); }