Submission #543422

#TimeUsernameProblemLanguageResultExecution timeMemory
543422NemanjaSo2005Detecting Molecules (IOI16_molecules)C++14
46 / 100
1095 ms2260 KiB
#include<bits/stdc++.h> #define ll long long using namespace std; int N,koji[500005]; vector<int> ret; vector<int> find_subset(int L, int R, vector<int> niz){ N=niz.size(); for(int i=1;i<=R;i++) koji[i]=-1; for(int i=0;i<N;i++){ for(int j=R-niz[i];j>=0;j--){ if(koji[j]==-1) continue; if(koji[j+niz[i]]==-1) koji[j+niz[i]]=i; } } int gde=-1; for(int i=L;i<=R;i++) if(koji[i]!=-1){ gde=i; break; } if(gde==-1) return ret; while(gde!=0){ ret.push_back(koji[gde]); gde-=niz[koji[gde]]; } return ret; }
#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...