| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1301808 | PakinDioxide | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 356 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> find_subset(int l, int r, vector<int> w) {
int n = w.size();
vector <pair <ll, int>> a(n);
for (int i = 0; i < n; i++) a[i] = make_pair(w[i], i);
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
for (int i = 1; i < n; i++) a[i].first += a[i-1].first;
vector <int> ans;
for (int i = 0; i < n; i++) {
if (a[i].first >= l && a[i].first <= r) {
for (int j = 0; j <= i; j++) ans.emplace_back(a[j].second);
break;
}
}
return ans;
}
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... | ||||
