# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239434 | GREGOIRELC | Detecting Molecules (IOI16_molecules) | C++14 | 88 ms | 6248 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
vector<int> find_subset(int l, int u, std::vector<int> w)
{
vector<pair<ll, ll> > val;
for(int i = 0; i < w.size(); i++)
{
val.push_back({w[i], i});
}
sort(val.begin(), val.end());
sort(w.begin(), w.end());
ll deb = 0, fin = 0;
ll s = 0;
while(fin < val.size() && s < l)
{
if(s + val[fin].first > u)
{
s -= val[deb].first;
s += val[fin].first;
deb++;
fin++;
}
else
{
s += val[fin].first;
fin++;
}
}
vector<int> result;
if(s < l || s > u)
{
return result;
}
for(int i = deb; i < fin; i++)
{
result.push_back(val[i].second);
}
return result;
}
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... |