# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
397032 | danielcm585 | Detecting Molecules (IOI16_molecules) | C++14 | 71 ms | 7284 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 "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> ii;
vector<int> find_subset(int a, int b, vector<int> w) {
vector<ii> v;
for (int i = 0; i < w.size(); i++) v.push_back({w[i],i});
sort(v.rbegin(),v.rend());
ll sum = 0;
vector<ii> tmp;
while (!v.empty()) {
ii cur = v.back();
if (sum+cur.fi > b) break;
sum += cur.fi;
tmp.push_back(cur);
v.pop_back();
}
for (int i = 0; i < min(v.size(),tmp.size()); i++) {
if (sum+v[i].fi-tmp[i].fi <= b) {
sum += v[i].fi-tmp[i].fi;
tmp[i] = v[i];
}
}
vector<int> res;
if (sum >= a) {
for (auto i : tmp) res.push_back(i.se);
}
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... |