# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1138315 | anmattroi | Detecting Molecules (IOI16_molecules) | C++17 | 34 ms | 4132 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using ii = pair<int, int>;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<ii> a;
int n = w.size();
for (int i = 0; i < n; i++) a.emplace_back(w[i], i);
sort(a.begin(), a.end());
int64_t s = 0;
for (int i2 = 0, i1 = 0; i2 < n; i2++) {
s += a[i2].fi;
while (i1 < i2 && s > u) {
s -= a[i1].fi;
++i1;
}
if (l <= s && s <= u) {
vector<int> ans;
for (int i = i1; i <= i2; i++) ans.emplace_back(a[i].se);
return ans;
}
}
return vector<int>(0);
}
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... |