| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1339377 | tsetsenbileg | Detecting Molecules (IOI16_molecules) | C++20 | 33 ms | 3752 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
using ld = long double;
using pr = pair<int, int>;
const int MOD = 1e9+7, MAXA = 1e6;
vector<int> find_subset(int l, int u, vector<int> w) {
int lef = 0;
ll sum = 0;
int n = w.size();
vector<pr> a(n);
for (int i = 0; i < n; i++) a[i] = {w[i], i};
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
sum += 1LL*a[i].first;
while (sum > u && lef < n) {
sum -= 1LL*a[lef].first;
lef++;
}
if (sum >= l && sum <= u) {
vector<int> res;
for (int j = lef; j <= i; j++) res.pb(a[j].second);
return res;
}
}
return {};
}
| # | 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... | ||||
