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;
long long sum ;
int x , n ;
vector < pair < int , int > > vec ;
vector < int > ans ;
vector < int > y ;
vector<int> find_subset(int l, int u, std::vector<int> w) {
n = w . size ( ) ;
for ( int i = 0 ; i < n ; i ++ ) {
vec . push_back ( { w [ i ] , i } ) ;
}
sort ( vec . begin ( ) , vec . end ( ) ) ;
x = 0 ;
for ( int i = 0 ; i < n ; i ++ ) {
while ( x < n && sum < l ) {
sum += vec [ x ] . first ;
x ++ ;
}
if ( sum >= l && sum <= u ) {
for ( int j = i ; j < x ; j ++ ) {
ans . push_back ( vec [ j ] . second ) ;
}
return ans ;
}
sum -= vec [ i ] . first ;
}
return y ;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |