# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1147651 | aqxa | Detecting Molecules (IOI16_molecules) | C++20 | 35 ms | 5192 KiB |
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<long long, int>> molecules(n);
for(int i = 0; i < n; i++) {
molecules[i] = {w[i], i};
}
sort(molecules.begin(), molecules.end());
int left = 0;
long long sum = 0;
for(int right = 0; right < n; right++) {
sum += molecules[right].first;
while(left <= right && sum > u) {
sum -= molecules[left].first;
left++;
}
if(sum >= l && sum <= u) {
vector<int> result;
for(int i = left; i <= right; i++) {
result.push_back(molecules[i].second);
}
sort(result.begin(), result.end());
return result;
}
}
return vector<int>();
}
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... |