| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1324649 | riafhasan2010 | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 332 KiB |
//#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
ll sum = 0;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
a[i].first = w[i];
a[i].second = i;
}
sort(a.begin(), a.end());
vector<ll> psum(n + 1); psum[0] = 0;
for (int i = 0; i < n; i++) {
psum[i + 1] = a[i].first + psum[i];
}
if (psum[n] < l or a[0].first > u) return vector<int>(0);
vector<int> ans;
for (int i = 1; i <= n; i++) {
int ind = n, left = 0, right = i - 1;
while (left <= right) {
int m = (left + right) / 2;
if (psum[i] - psum[m] >= l and psum[i] - psum[m] <= u) {
ind = m + 1;
break;
}
if (psum[i] - psum[m] > u) left = m + 1;
else right = m - 1;
}
if (ind != n) {
for (int j = ind; j <= i; j++) {
ans.push_back(a[j - 1].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... | ||||
