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>
using namespace std;
#define pb push_back
#define ll long long
#define ld long double
#define fi first
#define se second
#define F first
#define S second
#define pii pair < int , int >
#define _ <<" "<<
#define TIME 1.0 * clock() / CLOCKS_PER_SEC
#include "molecules.h"
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector < int > nul;
ll sum = 0;
int now = 0;
int n = w.size();
sort(w.begin(), w.end());
for (int i = 0; i < n; ++i){
sum += w[i];
while(sum > u) sum -= w[now++];
if (sum >= l){
for (; now <= i; ++now)
nul.pb(w[now]);
return nul;
}
}
return nul;
}
# | 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... |