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;
#define ll long long int
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
sort(w.begin(),w.end());
vector<int> ans;
int a=0;
int r=0;
int n=(int)w.size();
ll sum=0;
for(int i=0; i<n; i++) {
if(sum+w[i]<=l) {sum+=w[i]; r=i;}
else{
break;
}
}
while(r<n) {
if(sum>=l&&sum<=u) {
break;
}
sum+=w[++r];
sum-=w[a++];
}
for(int i=a; i<=r; i++) {
ans.push_back(i);
}
if(ans.size()) return ans;
return std::vector<int>(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... |