# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112296 | ioilolcom | Detecting Molecules (IOI16_molecules) | C++14 | 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;
#define ll long long int
int rad(int a,int b){
return rand%(b-a+1);
}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
ll sum=0;
vector<int> ans;
for(int i=0; i<(int)w.size(); i++) {
sum+=w[i];
ans.push_back(w[i]);
if(sum>r) {
int m=rad(0,(int)ans.size()) :
sum-=ans[m];
ans.erase(ans.begin()+m);
break;
}
}
if(sum>=l&&sum<=r) {
return ans;
}
return std::vector<int>(0);
}