# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51710 | tincamatei | 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>
#ifdef EVAL
#include "molecules.h"
#endif
using namespace std;
const int MAX_N = 200000;
long long _sp[1+MAX_N], *sp = _sp + 1;
vector<int> find_subset(int l, int u, vector<int> w) {
int n, lx, rx;
vector<int> result;
n = w.size();
lx = 2, rx = 1;
sort(w.begin(), w.end());
for(int i = 0; i < n; ++i) {
sp[i] = sp[i - 1] + w[i];
for(int j = -1; j < i; ++j)
if(l <= sp[i] - sp[j] && sp[i] - sp[j] <= u) {
lx = j + 1;
rx = i;
}
}
for(lx = lx + 1; lx <= rx; ++lx)
result.push_back(lx);
return result;
}
#ifndef EVAL
int main() {
int n, l, u;
assert(3 == scanf("%d %d %d", &n, &l, &u));
std::vector<int> w(n);
for (int i = 0; i < n; i++)
assert(1 == scanf("%d", &w[i]));
std::vector<int> result = find_subset(l, u, w);
printf("%d\n", (int)result.size());
for (int i = 0; i < (int)result.size(); i++)
printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}
#endif