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 <bits/stdc++.h>
using namespace std;
#include "molecules.h"
typedef vector <int> vi;
pair < int,int > A[200005];
int n,i,j;
long long t;
vi ans;
vi find_subset(int l, int u, vi a){
n = a.size();
for(i=0;i<n;i++)
A[i] = make_pair(a[i],i);
sort(A , A+n);
t = 0;
ans.clear();
for(i=j=0;i<n;i++){
for(;j<n && t < l; j++) t += A[j].first;
if(t >= l && t <= u){
for(; i<j ; i++)
ans.push_back(A[i].second);
break;
}
t -= A[i].first;
}
sort(ans.begin() , ans.end());
return ans;
}
# | 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... |