# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1024229 | vanea | Detecting Molecules (IOI16_molecules) | C++14 | 1 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;
using ll = long long;
vector<int> find_subset(int l, int u, vector<int> w) {
set<pair<int, int>> s;
vector<pair<ll, int>> v;
int n = w.size();
for(int i = 0; i < n; i++) {
v.push_back({w[i], i});
}
sort(v.begin(), v.end());
ll sum = 0;
for(int i = 0; i < n; i++) {
sum += v[i].first;
s.insert(v[i]);
if(sum > u) {
sum -= s.begin()->first;
s.erase(s.begin());
}
if(l <= sum && sum <= u) {
vector<int> res;
for(auto x : s) res.push_back(x.second);
return res;
}
}
}
/*
int main()
{
vector<int> ans = find_subset(15, 17, {6, 8, 8, 7});
for(auto it : ans) {
cout << it << ' ';
}
}*/
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... |