# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122274 | turbat | Detecting Molecules (IOI16_molecules) | C++14 | 2 ms | 384 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 u, vector<int> w) {
vector <int> ans;
vector <pair <int, int> > v;
for (int i = 0;i < w.size();i++)
v.push_back({w[i], i});
sort(v.begin(), v.end());
int s = 0;
for (int i = 1;i < v.size();i++){
if (s + v[i].first <= u){
s += v[i].first;
ans.push_back(v[i].second);
}
else {
if (s < l){
ans.push_back(v[i].second);
ans.erase(ans.begin() + 0);
if (s + v[i].first - v[0].first < l || s + v[i].first - v[0].first > u)
ans.clear();
}
break;
}
}
// cout << l << ' ' << u << endl;
// for (int x : ans)
// cout << x<< ' ';
// cout << endl;
sort(ans.begin(), ans.end());
return ans;
}
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... |