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>
typedef long long ll;
using namespace std;
const int maxn = 2e5+12;
ll pref[maxn];
int n;
vector<int> find_subset(int L, int R, vector<int> w){
n = w.size();
for(int i=1;i<=n;i++){
pref[i] = pref[i-1] + w[i-1];
}
for(int l=1;l<=n;l++){
for(int r=l;r<=n;r++){
if(pref[r] - pref[l-1] >= L && pref[r] - pref[l-1] <= R){
vector<int> ans;
for(int i=l;i<=r;i++){
ans.push_back(i-1);
}
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... |