# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
834525 | erdemkiraz | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 404 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>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
vector<int> find_subset(int L, int R, vector<int> v_o) {
ll l = L;
ll r = R;
vector<ii> v;
for(int it = 0; it < (int) v_o.size() - 1; it++) {
v.push_back({v_o[it], it});
}
sort(v.begin(), v.end());
if(v[0].first > R) return {};
if(v[0].first >= L) return {v[0].second};
if(v.back().first >= L) return {v[0].second};
ll sum = 0;
multiset<int> taken;
int until = -1;
for(int i = 0; i < (int) v.size(); i++) {
if(sum + v[i].first > r) break;
taken.insert(v[i].second);
sum += v[i].first;
# | 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... |