Submission #862044

#	Time	Username	Problem	Language	Result	Execution time	Memory
862044		culver0412	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	37 ms	5732 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    int siz=w.size();
    pair<int,int> arr[siz];
    for(int i=0;i<siz;i++){
        arr[i]={w[i],i};
    }
    sort(arr,arr+siz);
    long long int sum1=0,sum2=0;
    vector<int> ans;
    for(int i=0;i<siz;i++){
        sum1+=arr[i].first;
        sum2+=arr[siz-i-1].first;
        if(!(sum1<=u&&l<=sum2)){
            continue;
        }
        int j=i;
        while(sum1<l){
            sum1-=arr[j-i].first;
            j++;
            sum1+=arr[j].first;
        }
        for(int k=j-i;k<=j;k++){
            ans.push_back(arr[k].second);
        }
        return ans;
    }
    return ans;
}

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