# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156459 | a_player | Detecting Molecules (IOI16_molecules) | C++14 | 2 ms | 376 KiB |
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 f first
#define s second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
pair<int,int> dp[1001];
vector<int> find_subset(int l,int u,vector<int> w){
int N=w.size();
dp[0].f=1;
dp[0].s=-1;
for(int i=0;i<N;i++)
for(int j=l;j>=0;j--)
if(j-w[i]>=0)if(dp[j-w[i]].f)dp[j]=mp(1,i);
int t=-1;
for(int i=u;i<=l;i++)if(dp[i].f){
t=i;
break;
}vector<int> sol;
if(t==-1)return sol;
while(dp[t].s!=-1){
sol.push_back(dp[t].s);
t-=w[dp[t].s];
}
return sol;
}
Compilation message (stderr)
# | 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... |