Submission #416912

#	Time	Username	Problem	Language	Result	Execution time	Memory
416912		snasibov05	Detecting Molecules (IOI16_molecules)	C++14	19 / 100	1 ms	204 KiB

molecules

#include "molecules.h"
#include <algorithm>
#include <set>

using namespace std;

#define pb push_back
#define pii pair<int, int>
#define f first
#define s second
#define ll long long
#define pll pair<ll, ll>


vector<int> find_subset(int l, int u, vector<int> w) {

    int n = w.size();
    vector<pll> v(n);
    for (int i = 0; i < n; ++i) {
        v[i].f = w[i];
        v[i].s = i;
    }

    sort(v.begin(), v.end());

    set<int> st;
    ll sum = 0;
    int k = 0;
    for (int i = n-1; i >= 0; --i){
        sum += v[i].f;
        k = i;
        st.insert(v[i].s);
        if (sum >= l) break;
    }

    if (sum < l){
        vector<int> ans;
        return ans;
    } else if (sum >= l && sum <= u){
        vector<int> ans;
        for (auto x : st){
            ans.pb(x);
        }
        return ans;
    }

    for (int i = 0; i < min(k, (n+1)/2); ++i){
        ll dif = v[n-i-1].f - v[i].f;
        sum -= dif;
        st.erase(v[n-i-1].s);
        st.insert(v[i].s);
        if (sum <= u) break;
    }

    if (sum > u){
        return vector<int>(0);
    } else{
        vector<int> ans;
        for (auto x : st){
            ans.pb(x);
        }
        return ans;
    }

}

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