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;
multiset<int>u;
multiset<int>::iterator it;
long long sum = 0;
priority_queue<int, vector<int>, greater<int> >v;
std::vector<int> find_subset(int l, int r, std::vector<int> w) {
for (int tmp : w)
v.push(tmp);
while (!v.empty() && sum < l){
int tmp = v.top();
v.pop();
if (sum + tmp <= r){
sum += tmp;
u.insert(tmp);
continue;
}
it = u.lower_bound(tmp);
if (it != u.begin()){
it--;
sum += tmp - *it;
v.push(*it);
u.erase(it);
u.insert(tmp);
}
}
if (sum < l)
return std::vector<int>();
vector<int>res;
for (int i = 0; i < (int)w.size(); i++)
if (u.find(w[i]) != u.end()){
res.push_back(i);
u.erase(u.find(w[i]));
}
return res;
}
# | 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... |