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;
using ll = long long;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<array<int, 2>> p(n);
for(int i=0;i<n;i++) p[i] = {w[i], i};
sort(p.begin(), p.end());
for(int i=0;i<n;i++) w[i] = p[i][1];
for(ll i=0, j=0, s=0;i<n;i++) {
s += p[i][0];
while(s > u) s -= p[j++][0];
if(l <= s) return vector<int>(w.begin()+j, w.begin()+i+1);
}
return vector<int>(0);
}
# | 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... |