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"
#define f first
#define s second
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size(); vector<pair<int,int>> p(n);
for(int i=0;i<n;i++) p[i].f = w[i], p[i].s = i;
sort(begin(p),end(p));
long long x = 0, y = 0, c = p[0].f;
while(y < n) {
while(c > u) c -= p[x].f, x++;
if(c >= l) break;
y++; if(y < n) c += p[y].f;
}
vector<int> v;
if(y == n) return v;
else {for(int i=x;i<=y;i++) v.push_back(p[i].s); return v;}
}
# | 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... |