# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
867540 | StefanL2005 | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 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;
#define ll long long
vector<int> find_subset(int L, int R, vector<int> v)
{
int n = v.size();
vector<pair<int,int>> w(n);
for (int i = 0; i < n; i++)
w[i] = make_pair(v[i], i);
deque<int> Q;
vector<int> result;
ll sum = 0;
for (int i = 0; i < n; i++)
{
sum += w[i].first;
Q.push_back(w[i].second);
while(sum > R && !Q.empty())
{
sum -= w[Q.front()];
Q.pop_front();
}
}
while(!Q.empty())
{
result.push_back(Q.front());
Q.pop_front();
}
return result;
}