# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122292 | turbat | Detecting Molecules (IOI16_molecules) | C++14 | 2 ms | 384 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 <bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
vector <int> ans;
vector <pair <int, int> > v;
for (int i = 0;i < w.size();i++)
v.push_back({w[i], i});
sort(v.begin(), v.end());
int s = 0, curr = 0;
for (int i = 0;i < v.size();i++){
while (curr < v.size() && s + v[curr].first <= l)
s += v[curr++].first;
if (s >= l && s <= u){
for (int j = i;j < curr;j++)
ans.push_back(v[j].second);
return ans;
}
s -= v[curr].first;
}
return vector<int>(0);
}
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... |