# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1204257 | notme | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include<bits/stdc++.h>
#include "molecules.h"
using namespace std;
const int maxn = 2e6 + 10;
int n, pref[maxn], suff[maxn];
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
n = w.size();
vector < int > ans;
sort(w.begin(), w.end());
pref[0] = w[0];
for (int i = 1; i < n; ++ i)
pref[i] = pref[i-1] + w[i];
suff[n] = 0;
for (int i = n-1; i >= 0; -- i)
suff[i] = suff[i+1] + w[i];
vector < int > res;
for (int k = 1; k <= n; ++ k)
{
if(pref[k-1] <= u && suff[n - 1 - k + 1] >= l)
{
int lt = 0, rt = k-1, sum = pref[k-1];
while(sum < l)
{
sum -= w[lt];
sum += w[rt+1];
lt ++;
rt ++;
if(sum > u)break;
}
if(sum >= l && sum <= u)
{
for (int i = lt; i <= rt; ++ i)res.push_back(i);
return res;
}
}
}
return res;
}
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... |