# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
206359 | autumn_eel | Detecting Molecules (IOI16_molecules) | C++14 | 99 ms | 3948 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 rep(i,n)for(int i=0;i<(n);i++)
#include "molecules.h"
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<int>v;
for(int i:w)v.push_back(i);
sort(v.begin(),v.end());
ll Min=0,Max=0;
rep(i,v.size()){
Min+=v[i];
Max+=v[v.size()-i-1];
if(Min<=u&&l<=Max){
multiset<int>se;
for(int j=0;j<=i;j++)se.insert(v[j]);
ll sum=Min;
if(sum<l){
for(int j=i+1;j<v.size();j++){
int del=v[j]-*se.begin();
se.erase(se.begin());
se.insert(v[j]);
sum+=del;
if(l<=sum)break;
}
}
assert(sum<=u);
vector<int>ans;
rep(i,w.size()){
if(se.find(w[i])!=se.end()){
se.erase(se.find(w[i]));
ans.push_back(i);
}
}
return ans;
}
}
return {};
}
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... |