# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
715341 | 2023-03-26T14:26:17 Z | aykhn | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define OPT ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0) #define pii pair<int,int> #define pll pair<ll,ll> #define endl "\n" #define all(v) v.begin(), v.end() #define mpr make_pair #define pb push_back #define ts to_string #define fi first #define se second #define inf 0x3F3F3F3F #define bpc __builtin_popcount #define print(v) for(int i = 0; i < v.size(); i++) \ cout << v[i] << " "; \ cout<<endl; int find_subset(int lx, int u, int w[], int n, int result[]) { int l = 0; int r = 0; sort(w, w+n); ll sum = 0; while (r < n) { sum = sum + w[r]; while (sum > u) { sum = sum - w[l]; l++; } if (sum >= lx) { int k = 0; for (int i = l; i <= r; i++, k++) { result[k] = i; } return r - l + 1; } r++; } return 0; }