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>
#define N 1000009
#define pii pair <int, int>
#define ff first
#define sz() size()
#define ss second
#define pb push_back
#define ll long long
using namespace std;
int c[N], a[N], n;
vector<int> ans;
vector<int> find_subset(int l, int r, vector<int> v){
n=v.sz();
c[0]=1;
for(int i=0; i<n; i++){
for(int j=r; j>=0; j--)
if(c[j])
c[j+v[i]]=1, a[j+v[i]]=i;
}
for(int i=l; i<=r; i++){
if(c[i]){
int x;
int y=i;
while(y>0)
x=a[y], ans.pb(x), y-=v[x];
break;
}
}
return ans;
}
# | 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... |