제출 #1069545

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069545		Ignut	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	46 ms	7364 KiB

molecules

// Ignut

#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<pair<int, int>> v;
    for (int i = 0; i < n; i ++) v.push_back({w[i], i});
    sort(v.begin(), v.end());
    ll pref[n + 1] = {};
    for (int i = 0; i < n; i ++) pref[i + 1] = pref[i] + v[i].first;
    for (int l = 0; l < n; l ++) {
        int lo = l, hi = n - 1;
        while (lo < hi) {
            int mid = lo + (hi - lo) / 2;
            if (pref[mid + 1] - pref[l] < L)
                lo = mid + 1;
            else
                hi = mid;
        }
        if (pref[lo + 1] - pref[l] >= L && pref[lo + 1] - pref[l] <= U) {
            vector<int> res;
            for (int i = l; i <= lo; i ++)
                res.push_back(v[i].second);
            return res;
        }
    }
    return {};
}

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