# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1218895 | islam_2010 | Detecting Molecules (IOI16_molecules) | C++20 | 37 ms | 4128 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
long long s = 0;
vector<int> ans;
int le = 0;
int n = w.size();
vector<pair<int, int>> v;
for(int i = 0; i < n; i++){
v.push_back({w[i], i});
}
sort(v.begin(), v.end());
for(int r = 0; r < n; r++){
s += v[r].first;
while(s > u){
s -= v[le].first;
le++;
}
if(s >= l && s <= u){
for(int i = le; i <= r; i++){
ans.push_back(v[i].second);
}
sort(ans.begin(), ans.end());
return ans;
}
}
return {};
}
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... |