제출 #699930

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
699930		elkernos	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	1 ms	296 KiB

molecules

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

using namespace std;

typedef long long ll;
#define ssize(x) (int)size(x)

vector<int> find_subset(int l, int u, vector<int> w)
{
    vector<pair<int, int>> pairs(ssize(w));
    for (int i = 0; i < ssize(w); i++)
        pairs[i] = {w[i], i};
    sort(pairs.begin(), pairs.end());
    vector<ll> sum(ssize(w) + 1);
    for (int i = 0; i < ssize(w); i++)
        sum[i + 1] = sum[i] + pairs[i].first;
    for (int i = 1; i <= ssize(w); i++) {
        int where = lower_bound(sum.begin(), sum.begin() + i, sum[i] - u) - sum.begin();
        if (sum[i] - sum[where] >= l) {
            vector<int> wyp;
            for (int j = where + 1; j <= i; j++)
                wyp.push_back(pairs[i].second);
            return wyp;
        }
    }
    return vector<int>();
}

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