Submission #890224

#	Time	Username	Problem	Language	Result	Execution time	Memory
890224		MercubytheFirst	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	1054 ms	604 KiB

molecules

#include "molecules.h"
#include<algorithm>
#include<assert.h>
#include<numeric>
#include<iostream>
using namespace std;
using ll = long long;

vector<int> find_subset(int weight_low, int weight_hi, vector<int> w) {
    int n = w.size();
    vector<pair<int, int> > v(n);
    for(int i = 0; i < n; ++i)
        v[i] = {w[i], i};
    sort(v.begin(), v.end());
    for(int l = 0; l < n; ++l){
        for(int r = l; r < n; ++r){
            ll sum = 0;
            for(int i = l; i <= r; ++i)
                sum += v[i].first;
            if(weight_low <= sum and sum <= weight_hi){
                vector<int> ans;
                for(int i = l; i <= r; ++i)
                    ans.push_back(v[i].second);
                return ans;
            }
        }
    }
    return vector<int>();
}

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