# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1042603 | Zicrus | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 348 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;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w) {
ll tot = 0;
ll lCnt, hCnt;
sort(w.begin(), w.end());
for (auto &e : w) {
if (tot + e <= u) tot += e;
else {
if (e == w[0]) lCnt++;
else hCnt++;
}
}
ll sw = min(lCnt, hCnt);
ll fin = min(tot + sw, (ll)u);
ll used = fin - tot;
vector<int> res;
if (tot < l) return res;
ll tot2 = 0;
ll l2 = used, u2 = used;
for (int i = 0; i < w.size(); i++) {
if (tot2 + w[i] <= u) { tot2 += w[i]; res.push_back(i); }
else {
if (w[i] == w[0] && l2) { l2--; res.push_back(i); }
else if (w[i] != w[0] && u2) { u2--; res.push_back(i); }
}
}
return res;
}
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... |