Submission #380142

#	Time	Username	Problem	Language	Result	Execution time	Memory
380142		vishesh312	Detecting Molecules (IOI16_molecules)	C++17	0 / 100	0 ms	364 KiB

molecules

#include"molecules.h"
#include"bits/stdc++.h"
using namespace std;
using ll = long long;

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<pair<ll, int>> v;
    for (int i = 0; i < (int)w.size(); ++i) {
        v.push_back({w[i], i});
    }
    int n = w.size();
    sort(v.begin(), v.end());
    ll sum = 0;
    int i = 0;
    while (sum < l and i < n) {
        sum += v[i].first;
        ++i;
    }
    int end = i;
    i = 0;
    while (sum > u and i < n) {
        sum -= v[i].first;
        ++i;
    }
    vector<int> ret;
    for (; i < end; ++i) {
        ret.push_back(v[i].second);
    }
    sort(ret.begin(), ret.end());
    bool fsum = (sum >= l and sum <= u);
    i = n-1;
    sum = 0;
    while (sum < l and i >= 0) {
        sum += v[i].first;
        --i;
    }
    end = i;
    i = n-1;
    while (sum > u and i >= 0) {
        sum -= v[i].first;
        --i;
    }
    vector<int> r2;
    for (; i > end; --i) {
        r2.push_back(v[i].second);
    }
    sort(r2.begin(), r2.end());
    if (fsum) return ret;
    return r2;
}

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