Submission #935798

#	Time	Username	Problem	Language	Result	Execution time	Memory
935798		SpyrosAliv	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	1 ms	348 KiB

molecules

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>

vector<int> getans(int l, int r, vector<pll> w) {
    vector<int> a;
    for (int i = l; i < r; i++) {
        a.push_back(w[i].second);
    }
    return a;
}

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector<pll> arr;
    for (int i = 0; i < n; i++) {
        arr.push_back({w[i], i});
    }
    sort(arr.begin(), arr.end());
    int le = 0, r = 0;
    ll currSum = 0;
    while (r < n) {
        while (currSum < l && r < n) {
            currSum += arr[r++].first;
        }
        while (currSum > u && le < r) {
            currSum -= arr[le++].first;
        }
        if (currSum >= l && currSum <= u) {
            return getans(le, r, arr);
        }
        if (r < n) currSum += arr[r++].first;
    }
    return {};
}

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