# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1210618 | m5588ohammed | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int r, vector<int> w){
int n=w.size();
vector <array<int,2>> arr;
for(int i=0;i<n;i++) arr.push_back({w[i],i});
sort(arr.begin(),arr.end());
set <int> st;
vector <int> ans1,ans2;
long long sum1=0,siz=0,sum2=0;
//cout<<"HEEYYY"<<endl;
for(int i=n-1;i>=0;i--){
siz++;
ans1.push_back(arr[i][1]);
sum1+=arr[i][0];
if(l<=sum1&&sum1<=r) break;
if(sum1>r) break;
}
if(sum1<l) return {};
if(l<=sum1&&sum1<=r) return ans1;
for(int i=0;i<siz;i++){
st.insert(arr[i][1]);
sum2+=arr[i][0];
}
if(sum2>r) return {};
int p=n-1;
while(sum2<l){
auto idx=*st.begin();
sum2-=arr[idx][0];
st.erase(idx);
sum2+=arr[p][0];
st.insert(p);
p--;
}
for(int it:st) ans2.push_back(it);
return ans2;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |