# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
626949 | Trunkty | Detecting Molecules (IOI16_molecules) | C++14 | 96 ms | 14940 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
//#define ll ll
vector<int> find_subset(int l, int u, vector<int> w){
vector<vector<ll>> v;
for(ll i=0;i<w.size();i++){
v.push_back({w[i],i});
}
sort(v.begin(),v.end());
ll curra=0,currb=0,num=-1;
for(ll i=0;i<v.size();i++){
curra += v[i][0];
currb += v[v.size()-i-1][0];
if(curra>u){
return {};
}
if(currb>=l){
num = i;
break;
}
}
if(num==-1){
return {};
}
ll curr=curra;
vector<int> ans;
if(curr>=l and curr<=u){
for(ll j=0;j<=num;j++){
ans.push_back(v[j][1]);
}
return ans;
}
for(ll i=num;i>=0;i--){
curr -= v[i][0];
curr += v[i+v.size()-num-1][0];
if(curr>=l and curr<=u){
for(ll j=0;j<i;j++){
ans.push_back(v[j][1]);
}
for(ll j=i;j<=num;j++){
ans.push_back(v[j+v.size()-num-1][1]);
}
break;
}
}
return ans;
}
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... |