| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 785074 | Lyrically | 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;
#define pii pair<int,int>
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
int read(){int x;scanf("%d",&x);return x;}
void print(int x){printf("%d\n",x);}
void file(string s)
{
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
const int mod=998244353;
vector<int> find_subset(int l,int r,vector<int> w)
{
vector<pii> v;
rep(i,(int)w.size())
{
v.pb({w[i],i});
}
sort(v.begin(),v.end());
long long tot=0;
int n=(int)w.size();
vector<int> res;
rep(i,n)
{
tot=0;
for(int j=i;j<n;j++)
{
tot+=v[j].first;
if(tot>=l&&tot<=r)
{
for(int k=i;k<=j;k++)
{
res.pb(v[k].second);
}
sort(res.begin(),res.end());
return res;
}
}
}
return res;
}
signed main()
{
int n=read(),L=read(),R=read();
vector<int> w(n);
rep(i,n){w[i]=read();}
vector<int> cur=find_subset(L,R,w);
cout<<cur.size()<<endl;
rep(i,cur.size())
{
cout<<cur[i]<<" ";
}
return 0;
}