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"
using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w) {
sort(w.begin(),w.end());
ll sum = 0;
int r = 0,n = w.size();
for(int i=0;i<n;i++){
sum += w[i];
while(r < i && sum > u){
sum-=w[r++];
}
if(sum >= l && sum <= u){
vector<int> ans;
for(int j=r;j<=i;j++){
ans.push_back(j);
}
return ans;
}
}
return vector<int>();
}
/*
int main(){
vector<int> x ={6,8,8,7},v = find_subset(15,17,x);
for(auto i:v)cout<<i<<" ";
cout<<endl;
return 0;
}*/
| # | 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... |