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 a, int b, vector<int> in) {
int n;
n = in.size();
vector<pair<int, int>> w;
for (int i = 0; i < n; i++) {
w.push_back({in[i], i});
}
int l = 0, r = 0, s = w[0].first;
while(r < n-1) {
r++;
s += w[r].first;
while(s > b && l < r) {
s -= w[l].first;
l++;
}
if (a <= s && s <= b) {
vector<int> a;
for (int i = l; i <= r; i++) {
a.push_back(w[i].second);
}
return a;
}
}
return {};
}
# | 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... |