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;
typedef vector<int> vi;
typedef long long ll;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
vi find_subset(int l, int u, vi w) {
vi ans;
int n = w.size();
sort(w.begin(), w.end());
vector<ll> sum(n+1);
FOR(i, 1, n+1){
sum[i] = sum[i-1] + w[i-1];
}
FOR(i, 1, n+1){
if (sum[i] > u || sum[n] - sum[n-i] < l) continue;
FOR(j, i, n+1){
if (sum[j] - sum[j-i] >= l && sum[j] - sum[j-i] <= u){
FOR(k, j-i, j) ans.pb(k);
break;
}
}
break;
}
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... |