# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798731 | NeroZein | 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 "bits/stdc++.h"
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, l, r;
cin >> n >> l >> r;
vector<int> suf(n);
vector<int> pref(n);
vector<pair<int,int>> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i].first;
a[i].second = i;
pref[i] = suf[i] = a[i].first;
}
for (int i = 1; i < n; ++i) {
pref[i] += pref[i - 1];
}
for (int i = n - 2; i >= 0; --i) {
suf[i] += suf[i + 1];
}
auto print = [&](int x, int y) {
cout << y - x + 1 << '\n';
for (int i = x; i <= y; ++i) {
cout << a[i].second << ' ';
}
exit(0);
};
for (int sz = 1; sz <= n; ++sz) {
int ps = pref[sz - 1];
int sf = suf[n - sz];
if (ps >= l && ps <= r) {
print(0, sz - 1);
} else if (sf >= l && sf <= r) {
print(n - sz, n - 1);
} else if (ps < l && sf > r) {
for (int i = sz - 1; i < n; ++i) {
int rng = pref[i] - (i >= sz ? pref[i - sz] : 0);
if (rng >= l && rng <= r) {
print(i - sz + 1, i);
}
}
}
}
cout << 0 << '\n';
}