# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
284113 | IBMG | Detecting Molecules (IOI16_molecules) | C++14 | 1 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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
long au = 0;
int iz = 0, de = w.size()+1;
vector < pair < int, int > > v;
vector < int > ans;
for (int i = 0; i < w.size(); i ++)
{
v.push_back(make_pair(w[i], i+1));
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i ++)
{
au += v[i].first;
if (au >= u)
{
de = i;
break;
}
}
while (au > u)
{
au -= v[iz].first;
iz ++;
}
if (au >= l && au <= u)
{
for (int i = iz; i <= de; i ++)
{
ans.push_back(v[i].second);
}
}
sort(ans.begin(), ans.end());
return ans;
}
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... |