# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
788079 | YassirSalama | 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 "molecules.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define OVL(v,s) for(auto x:v) cout<<x<<s;cout<<endl;
const int MAXM=20000;
vector<vector<int>> dp(MAXM);
vector<int> v;
int L,U,N;
void find(int x){
}
#define all(v) v.begin(),v.end()
#define pb push_back
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<int,int>> v;
int n=w.size();
vector<int> pref(w.size()+100,0);
for(int i=0;i<w.size();i++){
v.pb({w[i],i});
}
sort(all(v));
for(int i=0;i<n;i++) pref[i+1]=pref[i]+v[i].first;
int i=0;
int j=0;
int cnt=0;
while(i<=j){
int x=pref[j+1]-pref[i];
cnt++;
// if(cnt==100) return vector<int>(0);
// cout<<i<<" "<<j<<" "<<x<<endl;
// break;
if(l<=x&&x<=u){
vector<int> ans;
for(int k=i;k<=j;k++){
ans.push_back(v[k].second);
}
return ans;
}
if(i==j) break;
if(j<=n-2) {
if(x<l)
j++;
}
if(x>u) i++;
}
return vector<int>(0);
}
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]);
}