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