#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, l, r) for(int i = l; i <= r; i++)
#define FORD(i, l, r) for(int i = l; i >= r; i--)
#define pb push_back
vector<int> find_subset(int lim_l, int lim_r, vector<int> w){
int n = w.size();
vector<pair<int, int>> a;
FOR(i, 0 ,n - 1){
a.push_back({w[i], i});
}
int p_l = 0, p_r = 0;
vector<int> res;
int l = 0, r = 0;
ll sum = 0;
while(r < n){
sum += a[r].first;
while(sum > lim_r && l <= r){
sum -= a[l++].first;
}
if(sum >= lim_l && sum <= lim_r){
FOR(i, a[l].second, a[r].second) res.pb(a[i].second);
return res;
}
++r;
}
return res;
}
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... |