# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62612 | Eae02 | Detecting Molecules (IOI16_molecules) | C++14 | 76 ms | 6624 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>
#define all(x) x.begin(),x.end()
struct Item
{
int weight;
int index;
bool operator<(const Item& other) const
{ return weight < other.weight; }
};
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
std::vector<Item> items(w.size());
for (int i = 0; i < w.size(); i++)
{
items[i].weight = w[i];
items[i].index = i;
}
std::sort(all(items));
int beg = 0;
int end = 0;
uint64_t sum = 0;
while (end <= items.size())
{
if (sum > (uint64_t)u)
{
sum -= (uint64_t)items[beg].weight;
beg++;
}
else if (sum < (uint64_t)l)
{
sum += (uint64_t)items[end].weight;
end++;
}
else
{
std::vector<int> indices;
for (int i = beg; i < end; i++)
indices.push_back(items[i].index);
return indices;
}
}
return {};
}
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... |