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 <bits/stdc++.h>
#include "molecules.h"
using namespace std;
#define ll long long
vector<int> find_subset(int L, int U, vector<int> W) {
ll l=L,u=U,n=W.size();
pair<ll,ll> w[n];
for(int i=0; i<n; ++i) w[i]={W[i],i};
sort(w,w+n);
ll left=0,curr=0;
for(int i=0; i<n; ++i) {
curr+=w[i].first;
if(curr<l) continue;
while(left<i && curr>u) {
curr-=w[left].first; ++left;
}
if(curr>=l && curr<=u) {
vector<int> ans;
for(int j=left; j<=i; ++j) ans.push_back(w[j].second);
return ans;
}
}
return {};
}
# | 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... |