Submission #636121

#	Time	Username	Problem	Language	Result	Execution time	Memory
636121		nehasane	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	46 ms	4104 KiB

molecules

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

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector <int> ans;
    vector <pair <int, int>> wt(n);
    for (int i = 0; i < n; i++)
        wt[i] = {w[i], i};
    sort(wt.begin(), wt.end());
    int lo = 0, hi = 0;
    long long sum = 0;
    while (sum < l || sum > u) {
        if (sum < l) {
            if (hi == n)
                break;
            sum += wt[hi].first;
            hi++;
        } else {
            if (lo > hi)
                break;
            sum -= wt[lo].first;
            lo++;
        }
    }
    if (sum < l || sum > u)
        return ans;
    for (int i = lo; i < hi; i++)
        ans.push_back(wt[i].second);
    return ans;
}

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