Submission #407053

#	Time	Username	Problem	Language	Result	Execution time	Memory
407053		dxz05	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	1 ms	204 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 5e5 + 3e2;

typedef long long ll;

pair<ll, int> a[MAXN];


vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();

    for (int i = 0; i < n; i++){
        a[i + 1] = make_pair(w[i], i);
        if (l <= w[i] && w[i] <= u){
            return {i};
        }
    }

    sort(a + 1, a + n + 1);

    ll sum = 0;

    vector<int> ans;

    int mn = n + 1;
    while (mn > 1){
        int ind = upper_bound(a + 1, a + n + 1, make_pair(l - sum, -1)) - a - 1;

        if (ind + 1 < mn && l <= sum + a[ind + 1].first && sum + a[ind + 1].first <= u){
            ans.push_back(a[ind + 1].second);
            return ans;
        }

        ind = min(ind, mn - 1);

        mn = ind;
        sum += a[ind].first;
        ans.push_back(a[ind].second);
    }

    return vector<int>(0);
}

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