제출 #958488

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
958488		MuntherCarrot	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	40 ms	7248 KiB

molecules

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

using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<pair<int, int>> a(n);
    for(int i = 0; i < n; i++){
        a[i] = {w[i], i};
    }
    sort(all(a));
    ll prf[n + 1] = {};
    for(int i = 1; i <= n; i++){
        prf[i] = prf[i - 1] + a[i - 1].first;
        int x = lower_bound(prf, prf + i, prf[i] - u) - prf;
        if(prf[i] - prf[x] >= l){
            vector<int> ans;
            for(int j = x; j < i; j++){
                ans.push_back(a[j].second);
            }
            return ans;
        }
    }
    return {};
}

// by me

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