# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199393 | kshitij_sodani | Detecting Molecules (IOI16_molecules) | C++17 | 1095 ms | 504 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 <iostream>
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
typedef long long int llo ;
#define mp make_pair
#define pb push_back
#define a first
#define b second
vector<int> find_subset(int l,int u,vector<int> w){
bitset<500001> dp;
dp.set(0);
for(int j=0;j<w.size();j++){
for(int i=500001;i>=w[j];i--){
dp[i]=dp[i] | dp[i-w[j]];
}
}
int ind=-1;
for(int i=l;i<u+1;i++){
if(dp[i]){
ind=i;
break;
}
}
//cout<<ind<<endl;
//cout<<w[dp[15]]<<endl;
vector<int> ans;
if(ind==-1){
return ans;
}
int vis[w.size()];
while(ind>0){
for(int i=0;i<w.size();i++){
if(vis[i]==1){
continue;
}
if(w[i]<=ind){
if(dp[ind-w[i]]){
ans.pb(i);
vis[i]=1;
ind-=w[i];
break;
}
}
}
}
return ans;
}
/*
int main(){
vector<int> ss=find_subset(15,17,{6,8,8,7});
for(int i=0;i<ss.size();i++){
cout<<ss[i]<<" ";
}
cout<<endl;
return 0;
}*/
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... |