# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600120 | Hazem | Detecting Molecules (IOI16_molecules) | C++14 | 57 ms | 6168 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 "bits/stdc++.h"
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pair<int,int>>vec;
for(int i=0;i<w.size();i++)
vec.push_back({w[i],i});
sort(vec.begin(),vec.end());
int L = 0,R = 0;
long long sum = vec[0].first;
vector<int>ans;
while(R<vec.size()){
if(sum>=l&&sum<=u){
for(int i=L;i<=R;i++)
ans.push_back(vec[i].second);
break;
}
if(sum<l)
sum += vec[++R].first;
else
sum -= vec[L++].first;
}
sort(ans.begin(),ans.end());
return ans;
}
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... |