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;
#define TRACE(x) cout << #x << " :: " << x << endl;
#define _ << " " <<
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
vector<int> find_subset(int l, int u, vector<int> w) {
int N = SZ(w);
int ind[N];
FOR(i,0,N-1){ ind[i] = i; }
sort(ind,ind+N,[=](int a, int b){ return (w[a] != w[b] ? w[a] < w[b] : a < b); });
long long sum = 0;
int x = 0, y;
for (y = 0; y < N; ++y) {
sum += w[ind[y]];
while (sum > u) sum -= w[ind[x++]];
if (sum >= l) break;
}
if (sum < l) return vector<int>();
else {
vector<int> ans(y-x+1);
FOR(i,x,y) ans[i-x] = ind[i];
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... |