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"
#define ll long long
using namespace std;
int N,koji[200005];
vector<int> ret;
vector<int> find_subset(int L, int R, vector<int> niz){
N=niz.size();
for(int i=1;i<=R;i++)
koji[i]=-1;
for(int i=0;i<N;i++){
for(int j=R-niz[i];j>=0;j--){
if(koji[j]==-1)
continue;
if(koji[j+niz[i]]==-1)
koji[j+niz[i]]=i;
}
}
int gde=-1;
for(int i=L;i<=R;i++)
if(koji[i]!=-1){
gde=i;
break;
}
if(gde==-1)
return ret;
while(gde!=0){
ret.push_back(koji[gde]);
gde-=niz[koji[gde]];
}
return ret;
}
# | 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... |