# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62606 | Eae02 | Detecting Molecules (IOI16_molecules) | C++14 | 4 ms | 492 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));
std::vector<int> indices;
auto itemsEnd = items.end();
while (true)
{
auto begIt = std::lower_bound(items.begin(), itemsEnd, Item { l, 0 });
auto endIt = std::lower_bound(items.begin(), itemsEnd, Item { u, 0 });
if (begIt != endIt)
{
indices.push_back(begIt->index);
return indices;
}
if (begIt == items.begin())
return {};
itemsEnd = begIt - 1;
indices.push_back(itemsEnd->index);
l -= itemsEnd->weight;
u -= itemsEnd->weight;
}
}
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... |