Submission #70097

#	Time	Username	Problem	Language	Result	Execution time	Memory
70097		evpipis	Detecting Molecules (IOI16_molecules)	C++11	100 / 100	110 ms	4528 KiB

molecules

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

//#define TEST

#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> ii;
vector<ii> val;

vector<int> find_subset(int l, int r, vector<int> W) {
    int n = W.size();
    ll sum = 0;
    for (int i = 0; i < n; i++)
        val.pb(mp(W[i], i));
    sort(val.begin(), val.end());

    vector<int> out;
    for (int i = 0, j = -1; i < n; i++){
        while (j < n-1 && sum+val[j+1].fi <= r)
            sum += val[++j].fi;

        if (l <= sum){
            for (int k = i; k <= j; k++)
                out.pb(val[k].se);
            break;
        }

        sum -= val[i].fi;
    }

    return out;
}

#ifdef TEST
int main() {
    freopen("02", "r", stdin);
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    std::vector<int> result = find_subset(l, u, w);


    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}

#endif // TEST

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