# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
301565 | chirathnirodha | Detecting Molecules (IOI16_molecules) | C++17 | 1043 ms | 2660 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;
vector<int> find_subset(int l, int u, vector<int> w) {
int n=w.size();
bool valid[u+1];
memset(valid,false,sizeof(valid));
int parent[u+1];
vector<int> v;
v.push_back(0);
valid[0]=true;
int foundval=-1;
for(int i=0;i<n;i++){
vector<int> temp;
for(int j=0;j<v.size();j++){
int newindex=v[j]+w[i];
if(newindex>u ||valid[newindex]==true)continue;
temp.push_back(newindex);
valid[newindex]=true;
parent[newindex]=i;
if(l<=newindex && newindex<=u){
foundval=newindex;
break;
}
}
if(foundval!=-1)break;
for(int j=0;j<temp.size();j++)v.push_back(temp[j]);
}
vector<int> ans;
if(foundval!=-1){
while(foundval!=0){
ans.push_back(parent[foundval]);
foundval-=w[parent[foundval]];
}
}
sort(ans.begin(),ans.end());
return ans;
}
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... |