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>
#include "molecules.h"
using namespace std;
const int mxN = 200005;
vector<int> find_subset(int l, int u, vector<int> w) {
sort(w.begin(), w.end());
vector<int> ans;
int i = 0, j = 0, sum = w[0];
while(j < (int) w.size()) {
if(sum >= l && sum <= u) break;
if(sum < l) {
if(j+1 < (int) w.size())
sum += w[++j];
else break;
} else
sum -= w[i++];
}
if(sum >= l && sum <= u) {
for(int k = i; k < j; k++)
ans.push_back(k);
}
return ans;
}
| # | 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... |