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>
#include <molecules.h>
using namespace std;
#define pb push_back
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
int left=1,right=1;
vector<long long> arr(n+1);
arr[0]=0;
for(int i = 1; i <= n; i++) {
arr[i] = arr[i-1]+w[i-1];
}
vector<int>ans;
while(right <= n) {
long long x = arr[right]-arr[left-1];
// cout << x << endl;
if(x < l)right++;
else if(x > u)left++;
if(x >= l && x <= u) {
for(int i = left-1; i < right; i++) {
ans.pb(i);
}
break;
}
}
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... |