Submission #432124

#TimeUsernameProblemLanguageResultExecution timeMemory
432124MonchitoDetecting Molecules (IOI16_molecules)C++14
9 / 100
1 ms332 KiB
#include "molecules.h" #include <algorithm> using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { vector<int> ret; bool can=false; int n = (int)w.size(); vector<pair<int,int>> W(n); for(int i=0; i<n; i++) W[i] = make_pair(w[i], i); sort(W.begin(), W.end()); pair<int,int> w1 = make_pair(W[0].first, 1); pair<int,int> w2 = make_pair(-1, 0); for(int i=1; i<n; i++) { if(w2 == make_pair(-1, 0)) { if(W[i].first == W[i-1].first) w1.second++; else w2 = make_pair(W[i].first, 1); } else w2.second++; } pair<int,int> p; for(int i=0; i<=w1.second; i++) { for(int j=0; j<=w2.second; j++) { int v = w1.first * i + w2.first * j; if(v >= l && v <= u) { can = true; p = make_pair(i, j); break; } } if(can) break; } if(can) { for(int i=0; i<n; i++) { if(p.first == -1 && p.second == 0) break; if(p.first == -1) { p.second--; ret.push_back(W[i].second); continue; } if(p.first > 0) { p.first--; ret.push_back(W[i].second); } else if(p.first == 0 && i<n-1 && W[i+1].first != W[i].first) p.first--; } } return (can)? ret : vector<int>(0); }
#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...