| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 346588 | Pety | 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;
vector<int>array_sort;
bool cmp (int a, int b) {
return array_sort[a] < array_sort[b];
}
int find_subset (int l, int u, int w[], int n, int result[]) {
vector<int>index;
index.resize(n);
for (int i = 0; i < n; i++) {
index[i] = i;
array_sort.push_back(w[i]);
}
sort(index.begin(), index.end(), cmp);
sort(w, w + n);
int ind = n;
long long sum =0;
for (int i = n - 1; i >= 0; i--) {
sum += w[i];
if (sum >= l) {
ind = i;
break;
}
}
if (ind == n)
return 0;
ind = n - ind;
sum = 0;
for (int i = 0; i < ind; i++)
sum += w[i];
int dr = n - 1;
while (ind <= dr && sum < l) {
sum += w[dr];
sum -= w[n - dr - 1];
dr--;
}
int m = 0;
for (int i = n - dr - 1; i < ind; i++)
result[m++] = index[i];
for (int i = dr + 1; i < n; i++)
result[m++] = index[i];
return m;
}
