# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1003562 | zh_h | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 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 lint long long int
#define pb push_back
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w){
vector<pair<int, int>> v;
for(int i = 0; i < w.size(); i ++){
v.pb({w[i], i});
}
// sort(w.begin(), w.end());
sort(v.begin(), v.end());
int ll = 0, rr = 0;
// int sum = w[0];
lint sum = v[0].first;
bool check = true;
while(check){
if(ll > rr){check = false; break;}
// else if(ll < 0){check = false; break;}
else if(rr > w.size()-1){check = false; break;}
else if(sum <= u && sum >= l){break;}
else if(sum > u){
// sum-= w[ll];
sum-=v[ll].first;
ll++;
}
else if(sum < l){
rr++;
// sum+=w[rr];
sum+=v[rr].first;
}
// cout << ll << " " << rr << endl;
}
vector<int> ans;
if(!check){return ans;}
else{
for(int i = ll; i <= rr; i ++){
// ans.pb(w[i]);
ans.pb(v[i].second);
}
sort(ans.begin(), ans.end());
return ans;
}
}
int main(){
vector<int> temp;
// temp = find_subset(15, 17, {6, 8, 8, 7});
// temp = find_subset(10, 20, {15, 17, 16, 18});
temp = find_subset(14, 15, {1, 2, 3, 4, 4});
// temp = find_subset(16, 16, {6, 8, 8, 7});
for(auto i : temp){cout << i << " ";} cout << endl;
}