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>
using namespace std;
#include "molecules.h"
vector<int> find_subset(int l, int u, vector<int> w){
vector<pair<long long,int> > srt;
for(int i=0; i<(int)w.size(); i++){
srt.push_back({w[i],i});
}
sort(srt.begin(),srt.end());
long long cur=0;
int c=0;
vector<int> ret;
for(int i=0; i<(int)srt.size(); i++){
while(c<(int)srt.size()&&cur<(long long)l){
cur+=srt[c].first;
c++;
}
if(cur>=(long long)l&&cur<=(long long)u){
for(int j=i; j<c; j++) ret.push_back(srt[j].second);
return ret;
}
cur-=srt[i].first;
}
return ret;
}
# | 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... |