# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
407075 | dxz05 | 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>
using namespace std;
const int MAXN = 5e5 + 3e2;
typedef long long ll;
pair<ll, int> a[MAXN];
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
for (int i = 0; i < n; i++){
a[i + 1] = make_pair(w[i], i);
if (l <= w[i] && w[i] <= u){
return {i};
}
}
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++){
vector<int> ans;
ll sum = 0;
for (int j = i; j <= n; j++){
sum += a[j].first;
ans.push_back(a[j].second);
if (l <= sum && sum <= r) return ans;
}
}
return vector<int>(0);
}