# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1235757 | badge881 | Detecting Molecules (IOI16_molecules) | C++20 | 34 ms | 4424 KiB |
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w)
{
vector<int> ord(w.size());
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int i, int j)
{ return w[i] < w[j]; });
vector<long long> ps(w.size() + 1, 0);
for (int i = 1; i <= w.size(); i++)
ps[i] = ps[i - 1] + w[ord[i - 1]];
int j = 1;
for (int i = 1; i <= w.size(); i++)
{
while (ps[i] - ps[j - 1] > u)
j++;
if (ps[i] - ps[j - 1] >= l)
{
vector<int> ans;
for (int k = j; k <= i; k++)
ans.push_back(ord[k - 1]);
return ans;
}
}
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... |