| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 546239 | Sergio_2357 | 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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll int
std::vector<int> find_subset(int l, int u, vector<int> w)
{
ll sum = 0;
vector<ll> a = w;
vector<int> us(n, 0);
int n = a.size();
sort(a.begin(), a.end());
int s = 0;
int e = n - 1;
while (sum < l && e >= 0) {
us[e] = 1;
sum += a[e];
e--;
}
e = n - 1;
while (sum > u && s < e) {
if (!us[e] || u[s])
break;
us[e] = 0;
us[s] = 1;
sum -= a[e];
sum += a[s];
e--;
s++;
}
if (sum > l && sum < u) {
vector<int> res;
for (int i = 0; i < n; i++) {
if (us[i])
res.push_back(i);
}
return res;
} else {
return vector<int>(0);
}
}
