# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65315 | zubec | Detecting Molecules (IOI16_molecules) | C++14 | 83 ms | 31832 KiB |
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;
typedef long long ll;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector <pair<int, int> > vec;
for (int i = 0; i < w.size(); i++){
vec.push_back({w[i], i});
}
int needL = -1, needR = -1;
sort(vec.begin(), vec.end());
ll sum = 0;
int curL = 0;
for (int i = 0; i < vec.size(); i++){
sum += vec[i].first;
while(sum > u){
sum -= vec[curL].first;
curL++;
}
if (l <= sum && sum <= u){
needL = curL;
needR = i;
}
}
if (needL == -1)
return {};
vector <int> ansvec;
for (int i = needL; i <= needR; i++)
ansvec.push_back(vec[i].second);
sort(ansvec.begin(), ansvec.end());
return ansvec;
}
Compilation message (stderr)
# | 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... |