This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
#define ll long long
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int, int>> vi;
vi.push_back({0, 0});
for(int i = 0; i < n; i++) {
vi.push_back({w[i], i});
}
sort(vi.begin(), vi.end());
vector<int> answ;
int lx = 1;
long long s = 0;
for(int r = 1; r <= n; r++) {
s += vi[r].first;
while(s > u) {
s -= vi[lx++].first;
}
if(s >= l && s <= u) {
for(int i = lx; i <= r; i++) {
answ.push_back(vi[i].second);
}
return answ;
}
}
return answ;
}
# | 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... |