Submission #374832

#	Time	Username	Problem	Language	Result	Execution time	Memory
374832		Alex_tz307	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	68 ms	5612 KiB

molecules

#include <bits/stdc++.h>

using namespace std;

vector<int> find_subset(int L, int R, vector<int> w) {
    int N = w.size();
    vector<pair<int,int>> a(N);
    for(int i = 0; i < N; ++i)
        a[i] = make_pair(w[i], i);
    sort(a.begin(), a.end());
    int l = 0;
    long long sum = 0;
    for(int r = 0; r < N; ++r) {
        sum += a[r].first;
        while(sum > R)
            sum -= a[l++].first;
        if(sum >= L) {
            vector<int> sol;
            for(int i = l; i <= r; ++i)
                sol.emplace_back(a[i].second);
            return sol;
        }
    }
    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