This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include<bits/stdc++.h>
#define pb push_back
#define x first
#define y second
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = (int)w.size();
vector<ii> v;
for(int i = 0;i < n;i++) v.pb({w[i], i});
sort(all(v));
int hi = 0;
ll sum = 0;
for(int lo = 0;lo < n;lo++) {
while(sum < l && hi < n) sum += (ll)v[hi].x, hi++;
if(l <= sum && sum <= u) {
vector<int> ans;
for(int i = lo;i < hi;i++)
ans.pb(v[i].y);
return ans;
}
sum -= (ll)v[lo].x;
}
return vector<int>();
}
# | 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... |