# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1203942 | arkanefury | Detecting Molecules (IOI16_molecules) | C++20 | 35 ms | 4132 KiB |
#include "molecules.h"
#define ll long long
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
ll n = w.size();
ll ans = 0;
vector<pair<int, int>>v;
ll mn = 0;
for(int i = 0; i < n; i ++)v.push_back({w[i], i});
sort(v.begin(), v.end());
vector<int>ko;
for(int i = 0; i < n; i ++){
ans += v[i].first;
while(ans > u)ans -= v[mn].first, mn ++;
if(ans >= l){
for(int j = mn; j <= i; j ++)ko.push_back(v[j].second);
return ko;
}
}
ko.clear();
return ko;
}
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... |