# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
912313 | Vladth11 | 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>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")
#include "molecules.h"
using namespace std;
typedef pair <int, int> pii;
const int NMAX = 200001;
pii v[NMAX];
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
for(int i = 0; i < n; i++){
v[i + 1] = {w[i], i + 1};
}
sort(v + 1, v + n + 1);
int lft = 1;
ll sum = 0;
for(int i = 1; i <= n; i++){
sum += v[i].first;
while(lft < i && sum - v[lft].first >= l){
sum -= v[lft].first;
lft++;
}
if(sum >= l && sum <= u){
vector <int> sol;
for(int j = lft; j <= i; j++){
sol.push_back(v[j].second - 1);
}
sort(sol.begin(), sol.end());
return sol;
}
}
vector <int> clr;
clr.clear();
return clr;
}