# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
196901 | Juney | Detecting Molecules (IOI16_molecules) | C++14 | 77 ms | 6276 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;
typedef long long ll;
typedef pair<int, int> pii;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<int> ans;
vector<pii> v;
for(int i=0; i<w.size(); i++) v.push_back(pii(w[i], i));
sort(v.begin(), v.end(), greater<pii>());
ll sum = 0;
for(int i=0; i<v.size(); i++) {
sum += v[i].first;
ans.push_back(v[i].second);
if(sum >= l) {
if(sum <= u) return ans;
int k = 0;
for(int j=v.size()-1; j>i && k<ans.size(); j--) {
sum -= w[ans[k]];
sum += w[v[j].second];
ans[k] = v[j].second;
k++;
if(sum <= u) return ans;
}
return vector<int> ();
}
}
return vector<int> ();
}
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... |