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 "molecules.h"
#include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back
using namespace std;
vector<int> p[500005];
vector<pair<int,int> >a;
int ans;
bool sum[500005];
vector<int> find_subset(int l, int r, vector<int> w)
{
for(int i=0; i<(int)w.size(); i++)
a.pb({w[i], i});
sort(a.begin(), a.end());
sum[0]=1;
for(pair<int,int> u : a)
{
for(int i=r; i>=0; i--)
{
if(sum[i] and i+u.F<=r and !sum[i+u.F])
{
sum[i+u.F]=1;
p[i+u.F]=p[i];
p[i+u.F].pb(u.S);
if(l<=i+u.F and i+u.F<=r)
{
ans=i+u.F;
break;
}
}
}
if(ans) break;
}
return p[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... |