| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1303707 | JahonaliX | Detecting Molecules (IOI16_molecules) | C++20 | 26 ms | 4636 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
deque<int> v;
int s = 0, n = w.size();
vector<int> o(n), vv;
iota(o.begin(), o.end(), 0);
sort(o.begin(), o.end(), [&] (int i, int j) { return w[i] > w[j]; });
for (int i : o) {
s += w[i];
v.emplace_back(i);
if (s > u) {
s -= w[v[0]];
v.pop_front();
continue;
}
if (s >= l && s <= u) break;
}
for (int i : v) vv.emplace_back(i);
if (s < l || s > u) return vector<int>(0);
return vv;
}
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... | ||||
