# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1085009 | nickolasarapidis | 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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w){
int N = w.size();
vector<pair<int, int>> W(N);
for(int i = 0; i < N; i++){
W[i] = make_pair(w[i], i);
}
vector<int> ans;
int sum = 0;
for(int i = 0; i < N; i++){
sum += W[i].first;
}
if(sum >= l and sum <= u){
for(int i = 0; i < N; i++){
ans.push_back(i);
}
return ans;
}
if(sum < l){
return ans;
}
sort(W.begin(), W.end());
bool found = false;
set<int> s;
sum = 0;
for(int i = 0; i < N; i++){
sum += W[i].first;
ans.push_back(W[i].second);
if(sum >= l and sum <= u){
found = true;
break;
}
}
if(found == false) return {};
/*for(int i = 0; i < N; i++){
if(s.count(W[i].second) == 0){
ans.push_back(W[i].second);
}
}*/
return ans;
}
int main(){
vector<int> A = find_subset(10, 20, {15, 16, 17, 18});
for(int i = 0; i < A.size(); i++){
cout << A[i] << " ";
}
}