# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
972301 | 2024-04-30T10:34:26 Z | vjudge1 | Detecting Molecules (IOI16_molecules) | C++11 | 0 ms | 0 KB |
#include "molecules.h" #include <bits/stdc++.h> using namespace std; #define int long long #define double long double #define pon ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); int T=1; #define ponchik signed main #define pb push_back #define pf push_front #define endl "\n" #define F first #define S second const long long N=1e5+69,INF=1e18+1488; vector<int> find_subset(int l, int u, vector<int> w) //int main() { long long n=w.size(),a=l,b=u; // vector <long long> w; // for (int i=0; i<n; i++) // { // int x; cin>>x; // w.pb(x); // } sort(w.begin(),w.end()); long long l1=0,r=0,sum=w[0]; vector <int> ans; while (l1<=r&&l1<n) { if (sum>=a&&sum<=b) { for (int i=l1; i<=r; i++) ans.pb(i); break; } if (sum<a) r++,sum+=w[r]; else if (sum>b) l1++,sum-=w[l1-1]; } return ans; }