# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
426238 | Play_Erwan | Detecting Molecules (IOI16_molecules) | C++11 | 1 ms | 332 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 "molecules.h"
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define F first
#define S second
int dp[10001],x,f;
vector<int> v;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
for(int i=0;i<=10000;i++)dp[i]=-1;
dp[0]=0;
for(int k=0;k<w.size();k++){
x=w[k];
for(int i=10000;i>=0;i--)if(dp[i]!=-1 && i+x<=10000){
dp[i+x]=k;
}
}
for(int i=l;i<=u;i++)if(dp[i]!=-1){f=i; break;}
while(f>0){
v.pb(dp[f]);
f-=w[dp[f]];
}
return v;
}
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... |