Submission #747701

#	Time	Username	Problem	Language	Result	Execution time	Memory
747701		_martynas	Detecting Molecules (IOI16_molecules)	C++11	100 / 100	41 ms	4940 KiB

molecules

#include "molecules.h"

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<int> id(n), ans;
    iota(id.begin(), id.end(), 0);
    sort(id.begin(), id.end(), [&](int i, int j) {
        return w[i] < w[j];
    });
    ll pref = 0, suff = 0;
    for(int i = 0; i < n; i++) {
        pref += w[id[i]];
        suff += w[id[n-i-1]];
        if(pref <= u && suff >= l) {
            if(pref >= l) {
                ans.resize(i+1);
                for(int k = 0; k <= i; k++) ans[k] = id[k];
                return ans;
            }
            ll sum = pref;
            for(int j = i+1; j < n; j++) {
                sum -= w[id[j-i-1]];
                sum += w[id[j]];
                if(sum >= l) {
                    ans.resize(i+1);
                    for(int k = j-i; k <= j; k++) ans[k-(j-i)] = id[k];
                    return ans;
                }
            }
        }
    }
    return vector<int>(0);
}

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