# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
960220 | 2024-04-09T23:51:03 Z | RyaroX | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h>s #include "molecules.h" typedef long long ll; ll dp[20005]; std::vector<int> find_subset(int l, int u, std::vector<int> w) { ll n=w.size(); ll d=0; dp[0]=1; for(ll i=0;i<n;i++){ ll a=w[i]; for(ll j=0;j<u;j++){ if(dp[j]>0){ dp[j+a]=a; if(j+a>=l and j+a<=u){ ll s=j+a; vector <ll> V; while(s>0){ //cout<<s<<" "<<dp[s]<<"\n"; V.push_back(dp[s]); s=s-dp[s]; } reverse(V.begin(), V.end()); return V; } } } } }