| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 632243 | device | 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>
#define int long long
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
int main(){
int n, l, u; cin >> n >> l >> u;
vector<pair<int,int>> v(n);
for(int i = 0; i < n; i++){
cin >> v[i].ff;
v[i].ss = i;
}
sort(v.begin(), v.end());
int cur = v[0].ff;
int ptr = 0;
if(cur >= l && cur <= u){
cout << 1 << endl << v[0].ss << endl;
return 0;
}
for(int i = 1; i < n; i++){
cur += v[i].ff;
if(cur >= l && cur <= u){
cout << i-ptr+1 << endl;
for(int j = ptr; j <= i; j++){
cout << v[j].ss << " ";
}
return 0;
}
while(cur > u && ptr <= i){
cur -= v[ptr].ff;
ptr++;
}
if(cur >= l && cur <= u){
cout << i-ptr+1 << endl;
for(int j = ptr; j <= i; j++){
cout << v[j].ss << " ";
}
return 0;
}
}
cout << 0 << endl;
}