# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1220470 | nickolasarapidis | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
vector<int> find_subset(int l, int r, vector<int> w){
int N = w.size(), sum = 0;
vector<pair<int, int>> W(N);
for(int i = 0; i < N; i++){
W[i] = {w[i], i};
}
sort(W.begin(), W.end());
int left = 0;
for(int right = 0; right < N; r++){
while(left < N and sum > r){
sum -= W[left].F;
left++;
}
if(sum >= l and sum <= r){
for(int i = left; i <= right; i++){
ans.push_back(W[i].S);
}
return ans;
}
sum += W[right].F;
}
return ans;
}