# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
873445 | Cutebol | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std ;
#define endl '\n'
#define int long long
vector <int> ans ;
vector <pair <int , int>> vec ;
std::vector<int> find_subset(int l, int u, vector<int> w) {
int sum = 0 , x = 0 ;
int n = w.size() ;
for ( int i = 0 ; i < n ; i ++ ) vec.push_back({w[i],i}) ;
sort ( vec.begin() , vec.end() ) ;
for ( int i = 0 ; i < n ; i ++ ){
sum += vec[i].first ;
while ( sum > u && x < n ) sum -= vec[x].first , x ++ ;
if ( x == n && sum > u ) return ans ;
if ( sum >= l ){
for ( int j = x ; j <= i ; j ++ ) ans.push_back(vec[j].second) ;
break ;
}
}
sort ( ans.begin() , ans.end() ) ;
return ans ;
}