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 int long long
using namespace std;
vector<signed> find_subset(signed l, signed u, vector<signed> w) {
int n = w.size();
u = min(u,accumulate(w.begin(), w.end(), 0));
sort(w.begin(), w.end());
int k = (l+w[0]-1)/w[0];
if(k > n || k*w[0] > u) return vector<signed>();
else return vector<signed>(k,w[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... |