# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
959981 | 2024-04-09T11:43:25 Z | okkoo | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 KB |
#include <iostream> #include <vector> #include <algorithm> #include <molecule.h> using namespace std; #define fastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define ll long long vector<int> find_subset(ll l, ll u, vector<int> w){ fastIO; vector<pair<int, int> > vt; int n = w.size(); for(int i=0; i<n; i++){ vt.push_back({w[i], i}); } sort(vt.begin(), vt.end()); int start = 0; ll curSum = 0; vector<int> ans; for(int i=0; i<n; i++){ curSum += w[i]; while(curSum > u){ curSum -= w[start]; start++; } if(curSum >= l){ while(start <= i){ ans.push_back(start); start++; } return ans; } } return {0}; }