Submission #578585

#TimeUsernameProblemLanguageResultExecution timeMemory
578585MrDebooDetecting Molecules (IOI16_molecules)C++17
9 / 100
1 ms304 KiB
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
    int n=w.size();
    vector<pair<int,int>>v;
    for(int i=0;i<n;i++)v.push_back({w[i],i});
    sort(v.begin(),v.end());
    sort(w.begin(),w.end());
    long long pre[n];
    pre[0]=w[0];
    for(int i=1;i<n;i++)pre[i]=pre[i-1]+w[i];
    w.push_back(0);
    int sm=0;
    vector<int>vct;
    for(int i=n;i>=0&&sm<=u;i--){
        sm+=w[i];
        int k=lower_bound(pre,pre+n,l-sm)-pre;
        if(k<i&&pre[k]+sm>=l&&pre[k]+sm<=u){
            for(int w=0;w<=k;w++)vct.push_back(v[w].second);
            for(int w=n-1;w>=i;w--)vct.push_back(v[w].second);
            break;
        }
    }
    return vct;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...