Submission #453656

#	Time	Username	Problem	Language	Result	Execution time	Memory
453656		ponytail	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	63 ms	7324 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w){
    ll n = w.size();
    pair<ll,ll> w2[n];
    bool used[n];
    ll tot_sum=0;
    for(int i=0;i<n;i++) w2[i].first = w[i];
    for(int i=0;i<n;i++)w2[i].second=i;
    for(int i=0;i<n;i++)tot_sum+=w2[i].first;
    for(int i=0;i<n;i++)used[i]=false;
    sort(w2,w2+n);
    ll curr_sum=0, pt=0, nani=0;
    for(int i=0;i<n;i++){
        curr_sum+=w2[i].first;
        if(u<curr_sum){
            curr_sum-=w2[i].first;
            pt=i;
            break;
        }
        used[i]=true;
        nani++;
        if(l<=curr_sum&&curr_sum<=u){
            vector<int> ans;
            for(int j=0;j<n;j++){
                if(used[j]) ans.push_back(w2[j].second);
            }
            return ans;
        }
    }
    for(int i=0;i<min(n-pt,pt);i++){
        curr_sum-=w2[i].first;
        used[i]=false;
        curr_sum+=w2[n-i-1].first;
        used[n-i-1]=true;
        if(l<=curr_sum&&curr_sum<=u){
            break;
        }
    }
    if(l<=curr_sum&&curr_sum<=u){
        vector<int> ans;
        for(int j=0;j<n;j++){
            if(used[j]) ans.push_back(w2[j].second);
        }
        return ans;
    }
    else{
        return {};
    }
}

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31