# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1138178 | Aliyyiakbar | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include "molecules.h"
#include "bits/stdc++.h"
using namespace std;
vector<int> find_subset(int a, int b, vector<int> w)
{
int n = w.size();
vector< pair<int, int> > v;
for (int i = 0; i <= n; ++i)
{
v.emplace_back(w[i], i);
}
sort(v.begin(), v.end());
vector<int> dp(n + 3);
for (int i = 1; i <= n; ++i)
{
dp[i] = dp[i-1] + v[i-1].first;
}
dp[n + 1] = dp[n];
int l = 1, r = 1, sum = 0;
while(1)
{
if (dp[r] - dp[l - 1] > b)
{
if (l == r)
{
return {};
}
++l;
}
else if (dp[r] - dp[l - 1] < a)
{
if (r == n + 1)
{
return {};
}
++r;
}
else
{
break;
}
}
vector<int> indicies;
for (int i = l - 1; i < r; ++i)
{
indicies.push_back(v[i].second);
}
return indicies;
}
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... |