# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
819527 | 12345678 | Detecting Molecules (IOI16_molecules) | C++17 | 44 ms | 5272 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;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<int> ans;
deque<pair<int, int>> dq;
vector<pair<int, int>> v;
long long sm=0;
for (int i=0; i<w.size(); i++) v.push_back({w[i], i});
sort(v.begin(), v.end());
for (int i=0; i<w.size(); i++)
{
dq.push_back(v[i]);
sm+=v[i].first;
if (sm<l) continue;
while (sm>u) sm-=dq.front().first, dq.pop_front();
if (sm>=l)
{
while (!dq.empty()) ans.push_back(dq.front().second), dq.pop_front();
return ans;
}
}
return vector<int> (0);
}
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... |