# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1141033 | SG2Alok | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<int> ans;
vector<pair<int, int>> nw;
for(int i = 0; i < nw.size(); i++){
nw.push_back({w[i], i});
}
sort(nw.begin(), nw.end());
long long sum = 0;
for(int i = 0, j = 0; j < nw.size(); j++){
sum += nw[j].first;
while(sum > u){
sum -= nw[i++].first;
}
if(sum >= l && sum <= u){
for(int k = i; k <= j; k++){
ans.push_back(nw[k].second);
}
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... |