# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698227 | 1zaid1 | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 300 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) {
int p = 0, sum = 0, e = v.size();
while (p < v.size() && sum + v[p] <= l) sum += v[p++];
if (sum == v.size()) return vector<int>(0);
vector<int> a;
for (int i = 0; i < p; i++) a.push_back(i);
while (p && sum < l) {
a[--p] = --e;
sum += v[e]-v[p];
} sum = 0;
for (int i:a) sum += i;
if (l <= sum && sum <= r) return a;
else return vector<int>(0);
}
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... |