# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698516 | 1zaid1 | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 304 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int l, int r, vector<int> v) {
vector<int> a;
int n = v.size(), sum = 0;
for (int i = n-1; i >= 0; i--) {
a.push_back(i);
sum += v[i];
if (sum >= l) break;
} if (sum < l) return {};
if (l <= sum && sum <= r) return a;
for (int i = 0; i < a.size() && i < a[i]; i++) {
sum += v[a[i]]-v[i];
a[i] = i;
if (sum <= r) break;
}
if (l <= sum && sum <= r) return a;
else return {};
}
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... |