# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1251496 | aren_dance | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n=w.size();
vector<pair<int,int>> mas;
for(int i=0;i<n;++i){
mas.push_back({w[i],i});
}
sort(mas.begin(),mas.end());
vector<int> k(n+1);
int las=0;
for(auto i:mas){
++las;
k[i.second]=las;
}
sort(w.begin(),w.end());
vector<long long> a;
for(int i=0;i<n;++i){
a.push_back(w[i]*1ll);
}
vector<long long> pref(n+1,0);
int id=-1;
int x;
vector<int> an;
for(int i=0;i<n;++i){
pref[i+1]=pref[i]+a[i];
int s=0;int e=i;
int answ=-1;
while(s<=e){
int m=(s+e)/2;
if(pref[i+1]-pref[m]>=l){
answ=m;
s=m+1;
}
else{
e=m-1;
}
}
if(answ==-1){
continue;
}
if(pref[i+1]-pref[answ]<=u){
id=answ;
x=i;
break;
}
}
if(id==-1){
return {};
}
long long s=0;
for(int i=id;i<=x;++i){
an.push_back(k[i]);
s+=a[i];
}
if(s>u){
return {};
}
sort(an.begin(),an.end());
return an;
}
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... |