# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31071 | platinant | Detecting Molecules (IOI16_molecules) | C++14 | 76 ms | 5340 KiB |
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 <algorithm>
using namespace std;
typedef pair<int,int> pp;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<int> ret;
vector<pp> a(w.size());
for(int i=0;i<w.size();i++){
a[i]=pp(w[i],i);
}
sort(a.begin(),a.end());
long long int len=0,sum=0;
while(len<a.size()&&sum<l){
sum+=a[len].first;
len++;
}
if(sum<l)return vector<int>(0);
if(sum<=u){
for(int i=0;i<len;i++)ret.push_back(a[i].second);
return ret;
}
if(len==1)return vector<int>(0);
sum -= a[len-1].first;
int L=1, R=len-1;
for(;R<w.size();R++,L++){
sum+=a[R].first-a[L-1].first;
if(sum>=l){
for(int i=L;i<=R;i++)ret.push_back(a[i].second);
return ret;
}
}
return vector<int>(0);
}
Compilation message (stderr)
# | 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... |