| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370709 | n.bahizi_dylan | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define v vector
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> pii;
v<int> find_subset(int l, int u, v<int> we) {
int n = we.size();
int rr = 0;
ll su = 0;
v<int> re;
v<pii> ite(n);
for(int i = 0; i < n;i++) {
ite[i] = {we[i], i};
}
sort(ite.begin(), ite.end());
for(int i = 0; i < n; i++) {
su += ite[i].first;
if(su >= l && su <= u) {
for(int j = rr; j <= i; j++) {
re.pb(ite[j].second);
}
}
if(su > u) {
su -= ite[rr].first;
rr++;
}
}
return re;
return{};
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
