| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370695 | n.bahizi_dylan | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#define v vector
#define pb push_back
v<int> find_subset(int l, int u, v<int> we) {
int n = we.size();
int y = 0;
int r = n - 1;
sort(we.begin(), we.end());
while(y < r) {
if(we[y] + we[r] <= u && we[y] + we[r] >= y) {
retur{y, r};
}
else if(we[y] + we[r] > u) {
r--;
}
else if(we[y] + we[r] < l) {
y++;
}
}
return {};
}