제출 #943840

#제출 시각아이디문제언어결과실행 시간메모리
943840ezzzayDetecting Molecules (IOI16_molecules)C++14
31 / 100
12 ms1400 KiB
#include "molecules.h" #include<bits/stdc++.h> using namespace std; const int N=2e5+5; #define pb push_back #define ff first #define ss second std::vector<int> find_subset(int l, int u, std::vector<int> w) { int n=w.size(); set<int>st; for(auto a:w)st.insert(a); if(st.size()==1){ int n=w.size(); int a=w[0]; int b=l/a; if(l%a)b++; vector<int>vcc; if(b*a<=u and b*a>=l and b<=n){ for(int i=0;i<b;i++)vcc.pb(i); } return vcc; } vector<int>dp[1002]; for(int i=0;i<n;i++){ for(int j=1000-w[i];j>=0;j--){ if(!dp[j].empty() and dp[j+w[i]].empty()){ dp[j+w[i]]=dp[j]; dp[j+w[i]].pb(i); } } dp[w[i]].pb(i); } for(int i=l;i<=u;i++){ if(!dp[i].empty())return dp[i]; } vector<int>vc; return vc; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...