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>
#define ll long long
using namespace std;
vector<int> find_subset(int l, int u, vector<int> W) {
vector<ll> w;
for(int i: W) w.push_back(i);
ll sum=0;
int n = w.size(), i = 0;
vector<int> ans;
while(i<n && sum+w[i]<=u) {
sum+=w[i];
ans.push_back(i);
i++;
}
i = n-1;
vector<int> added;
while(ans.size() && sum+w[i]-w[ans.back()]<=u) {
sum+=w[i]-w[ans.back()];
added.push_back(i);
i--;
ans.pop_back();
}
if(sum>=l && sum<=u) {
for(int k: added) {
ans.push_back(k);
}
return ans;
}
else {
return vector<int>();
}
}
# | 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... |