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;
vector<int> find_subset(int L, int R, vector<int> M){
int N = M.size();
bitset<500000> bits;
bits[0] = 1;
for(int i = 0; i < N; i ++){
int a = M[i];
bits |= (bits << a);
}
int t = 0;
for(int i = L; i <= R; i ++){
if(bits[i]){t = i;break;}
}
vector<int> p;
for(int i = 0; i < N; i ++){
int s = 0, id = i;
for(int j = i; j < N; j ++){
if(t >= M[j] && bits[t - M[j]] && s < M[j]){
s = M[j];
id = j;
}
}
if(s){
p.push_back(id);
t -= s;
}
}
return p;
}
# | 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... |