# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428525 | dreezy | 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>
#include "molecules.h"
using namespace std;
#define pb push_back
#define pi pair<int,int>
#define ll long long
#define mp make_pair
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pi> sorted(n);
for(int i =0;i<n ; i++)
sorted[i] = {w[i], i};
sort(sorted.begin(), sorted.end());
int lpntr = -1, rpntr = -1;
for(int k = 0; k< n; k++){
ll curans = 0;
int left = 0;
int right = left + k;
for(int i =left; i <= right; i++)
curans+=sorted[i].first;
if(curans >=l and curans <= u){
lpntr = left;
rpntr = right;
break;
}
bool won = true;
while(curans <l){
curans -= sorted[left++].first;
curans += sorted[++right].first;
if(curans >= l and curans <= u)
{
break;
}
else if(curans >= u || right == n-1)
{
won = false;
break;
}
}
if(won){
lpntr = left;
rpntr = right;
break;
}
}
if(lpntr == -1 and rpntr == -1)
return vector<int> ();
vector<int> ans;
for(int i = lpntr; i<= rpntr; i++)
ans.pb(sorted[i].second);
sort(ans.begin(), ans.end());
return ans;
}
/***************/
int main() {
freopen("input","r",stdin);
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]);
}