Submission #1098051

#	Time	Username	Problem	Language	Result	Execution time	Memory
1098051		dzhoz0	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	0 ms	348 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;


std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = (int)w.size();
    vector<pair<int, int>> a(n);
    for (int i = 0; i < n; i++) {
        a[i].first = w[i];
        a[i].second = i;
    }
    sort(a.begin(), a.end());
    vector<long long> ps(n);
    ps[0] = a[0].first;
    for (int i = 1; i < n; i++) {
        ps[i] = ps[i - 1] + a[i].first;
    }
    if(*lower_bound(ps.begin(), ps.end(), l) <= u) {
        vector<int> res;
        for (int i = 0; i < n; i++)
        {
            res.push_back(i);
            if(ps[i] >= l && ps[i] <= u)
                break;
            return res;
        }
    }

    for (int i = 0; i < n; i++) {
        auto it = lower_bound(ps.begin(), ps.end(), ps[i] + l);
        if(it == ps.end())
            continue;
        if(*it - ps[i] <= u) {
            int id = it - ps.begin();
            vector<int> res;
            for (int j = i + 1; j <= id; j++)
            {
                res.push_back(j);
            }
            return res;
        }
    }
    return std::vector<int>(0);
}

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