#include<bits/stdc++.h>
#include "molecules.h"
#define pb push_back
using namespace std;
const int maxn = 2e5 + 10;
long long n, pref[maxn], suff[maxn];
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{n = w.size();
vector < pair < long long , long long > > g;
for (int i = 0; i < n; ++ i)
g.pb(make_pair(w[i], i));
sort(g.begin(), g.end());
pref[0] = g[0].first;
for (int i = 1; i < n; ++ i)
pref[i] = pref[i-1] + g[i].first;
suff[n] = 0;
for (int i = n-1; i >= 0; -- i)
suff[i] = suff[i+1] + g[i].first;
vector < int > res;
for (int k = 1; k <= n; ++ k)
{
if(pref[k-1] <= u && suff[n - 1 - k + 1] >= l)
{
long long lt = 0, rt = k-1, sum = pref[k-1];
while(sum < l)
{
sum -= g[lt].first;
sum += g[rt+1].first;
lt ++;
rt ++;
if(sum > u)break;
}
if(sum >= l && sum <= u)
{
for (int i = lt; i <= rt; ++ i)
{
res.push_back(g[i].second);
}
return res;
}
}
}
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... |