# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1280090 | cnastea | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
int find_subset(int l, int r, int w[], int n, int x[]){
vector<pair<int, int>> a(n); for(int i = 0; i < n; i++) a[i] = {w[i], i};
sort(a.begin(), a.end());
long long p = a[0].f, q = 0, c = 0, k;
for(int i = 1; i < n; i++){
if(p > r && q < l) {c = 1; break;}
p += a[i].f; q += a[n-i].f;
}
p += a[n-1].f; if(p < l) c = 1;
if(c) return 0;
set<int> s; p = 0; q = n-1;
for(int i = 0; i < n; i++){
p += a[i].f; if(p > r) {p -= a[i].f; break;}
s.insert(i);
}
if(p >= l) {
int m = s.size();
for(int i = 0; i < m; i++) {x[i] = a[*s.begin()].s; s.erase(s.begin());}
return m;
}
while(1){
p -= a[*s.begin()].f;
s.erase(s.begin()); s.insert(q);
p += a[q].f; q--;
if(p >= l) break;
}
int m = s.size();
for(int i = 0; i < m; i++) {x[i] = a[*s.begin()].s; s.erase(s.begin());}
return m;
}