| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1307727 | ayaz | Detecting Molecules (IOI16_molecules) | C++20 | 36 ms | 4260 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define isz(x) (int)x.size()
#define all(x) (x).begin(),(x).end()
using vi = vector<int>;
using ll = long long;
using pii = pair<int, int>;
vi find_subset(int l, int r, vi w) {
int n = isz(w);
vector<array<int, 2>> a(n);
vi pre(n);
for (int i = 0; i < n; i++) a[i] = {w[i], i};
sort(all(a));
for (int i = 0; i < n; i++) pre[i] = (i == 0 ? a[i][0] : a[i][0] + pre[i - 1]);
for (int i = 0; i < n; i++) {
int cur = 0;
int low = i, high = n - 1;
auto check = [&](int x) -> bool {
return (pre[x] - (i == 0 ? 0 : pre[i - 1]) <= r);
};
while (low <= high) {
int mid = (low + high) >> 1;
if (check(mid)) {
low = mid + 1;
} else {
high = mid - 1;
}
}
int sum = pre[low - 1] - (i == 0 ? 0 : pre[i - 1]);
if (l <= sum && sum <= r) {
vi idx;
for (int j = i; j < low; j++) idx.push_back(a[j][1]);
return idx;
}
}
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... | ||||
