제출 #407091

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
407091		dxz05	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	143 ms	16624 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);

    set<ll> s = {0};

    ll sum = 0;
    for (int i = 1; i <= n; i++){
        sum += a[i].first;

        if (*s.rbegin() < sum - u){
            s.insert(sum);
            continue;
        }

        ll x = *s.lower_bound(sum - u);
        if (l <= sum - x && sum - x <= u){
            sum = 0;
            vector<int> ans;
            while (true){
                ans.push_back(a[i].second);
                sum += a[i].first;
                i--;
                if (l <= sum && sum <= u) return ans;
            }
        }
        s.insert(sum);
    }

    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