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>
#include "molecules.h"
using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<int> empty;
int mn = INT_MAX, mx = 0;
for(auto i: w) {
mn = min(i, mn);
mx = max(i, mx);
}
// substask 1
if (mn == mx) {
int a = (u % w[0]);
if (a <= n && l <= a*w[0] && a*w[0] <= u) {
vector<int> r;
for(int i=0;i<a;i++) {
r.push_back(i);
}
return r;
} else {
return empty;
}
}
return empty;
}
# | 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... |