#include "molecules.h"
#include<bits/stdc++.h>
#define int long long
using namespace std;
bool intersect(int l1, int r1, int l2, int r2)
{
return max(l1, l2) <= min(r1, r2);
}
vector<int32_t> find_subset(int32_t l, int32_t r, vector<int32_t> w) {
int n = w.size();
vector<pair<int, int>> a(n);
for(int i = 0; i < n; i++){
a[i].first = w[i]; a[i].second = i;
}
sort(a.begin(), a.end());
int minval = 0, maxval = 0, p = 0;
bool ok = 0;
while(p < n){
minval += a[p].first; maxval += a[n-1-p].first;
if(intersect(minval, maxval, l, r) == 1){ok = 1; break;}
p++;
}
if(ok == 0) return {};
int sum = minval, ansp = 0;
while(sum < l){
sum += a[ansp+p+1].first; sum -= a[ansp].first; ansp++;
}
vector<int32_t> ans;
for(int i = ansp; i <= ansp+p; i++) ans.push_back(a[i].second);
sort(ans.begin(), ans.end());
return ans;
}
Compilation message (stderr)
molecules.h:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~| # | 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... |