# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
942021 | hlk28khuong | 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 <cstdio>
#include <vector>
#include <cassert>
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define isz(a) ((int)(a.size()))
typedef pair<int,int>ii;
vector<int> find_subset(int l, int u, vector<int> w)
{
int n=isz(w);
vector<ii>tmp;
for(int i=0;i<n;i++)
tmp.push_back(ii(w[i],i));
sort(tmp.begin(),tmp.end());
vector<int>res;
int L=0;
int sum=0;
for(int i=0LL;i<isz(tmp);i++)
{
sum+=tmp[i].first;
while(sum>u&&L<=i)
{
sum-=tmp[L].first;
L++;
}
if(sum>=l&&sum<=u)
{
for(int j=L;j<=i;j++)
res.push_back(tmp[j].second);
sort(res.begin(),res.end());
break;
}
}
return res;
}
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]);
}