# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
655878 | horiseun | Detecting Molecules (IOI16_molecules) | C++11 | 48 ms | 6180 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 <iostream>
#include <vector>
#include <tuple>
#include <algorithm>
#include "molecules.h"
using namespace std;
#define ll long long
#define f first
#define s second
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<int, int>> v;
for (int i = 0; i < w.size(); i++) {
v.push_back({w[i], i});
}
sort(v.begin(), v.end());
int f = 0, b = 0;
ll sum = v[0].f;
vector<int> ans;
while (f < v.size()) {
if (l <= sum && sum <= u) {
for (int i = b; i <= f; i++) {
ans.push_back(v[i].s);
}
return ans;
} else if (sum < l) {
f++;
sum += v[f].f;
} else if (sum > u) {
sum -= v[b].f;
b++;
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |