# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164169 | canhnam357 | Detecting Molecules (IOI16_molecules) | C++20 | 34 ms | 4132 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pair<int, int>> a;
int n = w.size();
for (int i = 0; i < n; i++)
{
a.emplace_back(w[i], i);
}
sort(a.begin(), a.end());
long long sum = 0;
for (int s = 0, e = 0; e < n; e++)
{
sum += a[e].first;
while (sum > u) sum -= a[s++].first;
if (sum >= l)
{
vector<int> res;
for (int i = s; i <= e; i++) res.push_back(a[i].second);
return res;
}
}
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... |