# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1150528 | eldorbek_008 | Detecting Molecules (IOI16_molecules) | C++17 | 38 ms | 3656 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int r, vector<int> w) {
int n = w.size();
vector<array<int, 2>> a(n);
for (int i = 0; i < n; i++) {
a[i][0] = w[i];
a[i][1] = i;
}
sort(a.begin(), a.end());
int i = 0, j = 0;
int lx = -1, rx = -1;
long long sum = 0;
while (i < n and j < n) {
sum += a[j][0];
if (l <= sum and sum <= r) {
lx = i;
rx = j;
break;
}
if (sum < l) {
j += 1;
} else {
sum -= a[i][0] + a[j][0];
i += 1;
}
}
vector<int> id;
if (rx >= n or rx < 0) {
return id;
}
for (int i = lx; i <= rx; i++) {
id.push_back(a[i][1]);
}
sort(id.begin(), id.end());
return id;
}
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... |