# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
137367 | Hassoony | Detecting Molecules (IOI16_molecules) | C++17 | 145 ms | 632 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>
#include "molecules.h"
//#include "grader.cpp"
using namespace std;
typedef long long ll;
const int MX=10002;
bool dp[MX];
int last[MX];
vector<int> find_subset(int l, int u, vector<int> w) {
dp[0]=1;
last[0]=-1;
for(int i=0;i<w.size();i++){
for(int j=u;j>=0;j--){
if(j-w[i] >= 0){
if(dp[j-w[i]] && !dp[j])dp[j]=1,last[j]=i;
}
}
}
vector<int>ret;
int id=-1;
for(int i=l;i<=u;i++){
if(dp[i]){id=i;break;}
}
if(id==-1)return ret;
while(last[id]!=-1){
ret.push_back(last[id]);
id-=w[ret.back()];
}
return ret;
}
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... |