# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1221042 | madamadam3 | Detecting Molecules (IOI16_molecules) | C++20 | 1095 ms | 2628 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<int> wsort(n); iota(wsort.begin(), wsort.end(), 0);
sort(wsort.begin(), wsort.end(), [&](int a, int b) {return w[a] < w[b];});
vector<int> ans;
vector<int> prefix(n+1, 0); for (int i = 1; i <= n; i++) prefix[i] = prefix[i-1] + w[wsort[i-1]];
for (int i = 1; i <= n; i++) {
if (!ans.empty()) break;
for (int j = i; j <= n; j++) {
int pv = prefix[j] - prefix[i-1];
if (l <= pv && pv <= u) {
for (int k = i-1; k < j; k++) ans.push_back(wsort[k]);
break;
}
}
}
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... |