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;
const int N = (int)2e5 + 7;
int n, a[N];
int L, R;
vector<int> find_subset(int _l, int _u, vector<int> _w) {
n = (int)_w.size();
L = _l;
R = _u;
for(int i = 0; i < n; ++i) {
a[i] = _w[i];
}
for(int cnt = 1; cnt <= n; ++cnt) {
if(cnt*a[0] >= L && cnt*a[0] <= R) {
vector<int> ans;
for(int i = 0; i < cnt; ++i) {
ans.push_back(i);
}
return ans;
}
}
return {};
}
# | 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... |