# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319593 | knon0501 | Detecting Molecules (IOI16_molecules) | C++14 | 52 ms | 6360 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 <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<int> ans;
vector<pair<int,int>> a;
for(int i=0 ; i<w.size() ; i++)a.push_back({w[i],i});
sort(a.begin(),a.end(),[&](pair<int,int> x,pair<int,int> y){
return x.first>y.first;
});
int idx=0;
for(auto k: w){
if(k>=l && k<=u){
ans={idx};
return ans;
}
idx++;
}
long long s=0;
int n=w.size();
int j=0;
for(int i=0 ; i<n ; i++){
while(s<l && j<n){
s+=a[j].first;
j++;
}
if(s<=u && s>=l){
for(int k=i ; k<j ; k++)ans.push_back(a[k].second);
sort(ans.begin(),ans.end());
return ans;
}
s-=a[i].first;
}
return {};
}
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... |