# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921340 | H1H | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 604 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>
#define T "Task"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w){
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> a1, pair<int,int> a2){
return a1.first < a2.first;
});
vector<int> ans;
if(u < a[0].first)return ans;
long long sum_val = 0;
int idL = 0, idR = a.size()-1;
vector<bool> ok(w.size(), 0);
while(true){
if(idL > idR)break;
sum_val += a[idR].first;
ok[a[idR].second] = 1;
while(sum_val > u && idL < idR){
sum_val -= a[w.size() - idL - 1].first;
ok[a[w.size() - idL - 1].second] = 0;
if(sum_val >= l && sum_val <= u)break;
sum_val += a[idL].first;
ok[a[idL].second] = 1;
++idL;
}
--idR;
if(sum_val >= l && sum_val <= u){
for(int i = 0; i < ok.size(); ++i)
if(ok[i])ans.push_back(i);
return ans;
}
}
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... |