# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114582 | 2024-11-19T08:13:50 Z | lftroq | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> #include "molecules.h" using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { vector<pair<int,int>> a; for(int i=0;i<(int)size();i++) a.push_back({w[i],i}); sort(a.begin(),a.end()); long long s=0; for(int i=0,j=0;i<(int)w.size();i++) { s+=a[i].first; while(s>u) s-=a[j++].first; if(s>=l) { vector<int> ans; for(int k=j;k<=i;k++) ans.push_back(a[k].second); return ans; } } return {}; }