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 pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
pii a[200100];
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
for(int i=1; i<=n; i++){
a[i] = {w[i - 1], i - 1};
}
sort(a + 1, a + 1 + n);
for(int i=1; i<=n; i++){
ll sum = 0;
for(int j=1; j<=i-1; j++) sum += a[j].ff;
for(int j=i; j<=n; j++){
sum += a[j].ff;
sum -= a[j-i].ff;
//cout<<j-i+1<<' '<<j<<' '<<sum<<'\n';
if(sum >= l and sum <= u){
vector<int> ans;
for(int k=j-i+1; k<=j; k++){
ans.pb(a[k].ss);
}
return ans;
}
}
}
return {};
}
# | 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... |