# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167875 | Peacher29 | Detecting Molecules (IOI16_molecules) | C++14 | 61 ms | 5752 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;
bool b[200000];
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pair<int,int>> p(w.size());
vector<int> er;
int n=w.size();
for(int i=0;i<w.size();i++){
p[i].first=w[i];
p[i].second=i;
}
sort(p.begin(),p.end());
long long osszeg=0;
for(int i=p.size()-1;i>=0 && osszeg < l ; i--){
osszeg+=p[i].first;
b[i]=1;
}
int p1=p.size()-1, p2=0;
while(osszeg>u){
if(b[p2]){
break;
}
if(!b[p1]){
break;
}
b[p2]=1;
b[p1]=0;
osszeg-=p[p1].first;
osszeg+=p[p2].first;
++p2;
--p1;
}
if(osszeg>=l && osszeg <= u){
for(int i=0;i<n;i++){
if(b[i])
er.push_back(p[i].second);
}
}
return er;
}
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... |