Submission #725373

#TimeUsernameProblemLanguageResultExecution timeMemory
725373AndrijaMDetecting Molecules (IOI16_molecules)C++14
0 / 100
1 ms596 KiB
#include <bits/stdc++.h> using namespace std; vector<int>arr; int n; int dp[105][1005]; int f(int idx,int x,vector<int>vec,vector<int>weight) { if(idx==n) { arr=vec; return 0; } if(dp[idx][x]!=-1)return dp[idx][x]; int rez=0; rez=max(rez, f(idx+1,x,vec,weight)); vector<int>pom; pom=vec; pom.push_back(idx); if(x-weight[idx]>=0) rez=max(rez, f(idx+1,x-weight[idx],pom,weight)+weight[idx]); return dp[idx][x]=rez; } vector<int> find_subset(int l, int u, vector<int> w) { memset(dp,-1,sizeof dp); vector<int>v; queue<int>Q; n=w.size(); int kol=f(0,u,v,w); if(kol<=l) { return {}; } return arr; }
#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...