# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
740499 | JakobZorz | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 212 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 <algorithm>
using namespace std;
#define ll long long
vector<int> find_subset(int l, int u, vector<int> w) {
int m1=0,m2=0;
int sum=0;
sort(w.begin(),w.end());
while(sum<l&&m2<w.size())
sum+=w[m2++];
while(sum>u&&m1<m2)
sum-=w[m1++];
if(sum>=l&&sum<=u){
vector<int> res;
for(int i=m1;i<m2;i++)
res.push_back(w[i]);
return res;
} else return {};
}
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... |