# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401847 | rayna | Detecting Molecules (IOI16_molecules) | C++17 | 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 <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <list>
#include <string>
#include <queue>
#include <math.h>
#include <algorithm>
using namespace std;
typedef vector<int> vi;
typedef set<int> si;
typedef pair<int, int> pii;
int find_subset(int l, int u, int x[], int n, int result[]) {
vi a[n];
for (int i=0; i<n; i++) {
a[i] = {x[i], i};
}
sort(a, a+n);
long long s = 0; int k = 0;
for (int i=0; i<n; i++) {
s += a[i][0];
if (s >= l) {
if (s <= u) {
//fill result with 0 to i, inc
for (int j=0; j<=i; j++) {
result[j] = a[j][1];
}
return i+1;
}
if (i == 0) {
return 0;
}
s -= a[i][0];
k = i-1;
break;
}
}
for (int i=1; i<(n-k); i++) {
s -= a[i-1][0];
s += a[i+k][0];
if (s >= l) {
for (int j=i; j<=(i+k); j++) {
result[j-i] = a[j][1];
}
return k+1;
}
}
return 0;
}