Submission #957224

#	Time	Username	Problem	Language	Result	Execution time	Memory
957224		inkvizytor	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	41 ms	10604 KiB

molecules

#include "molecules.h"
#define fi first
#define se second
#include <bits/stdc++.h>
using namespace std; 

std::vector<int> find_subset(int l, int u, std::vector<int> w) {    int n = w.size();    vector<pair<long long, int>> s;    for (int i = 0; i < n; i++) {        s.push_back(make_pair((long long)w[i], i));    }    sort(s.begin(), s.end());    vector<long long> sp (n, 0);    vector<long long> ss (n, 0);    sp[0] = s[0].fi;    ss[n-1] = s[n-1].fi;    for (int i = 1; i < n; i++) {        sp[i] = sp[i-1]+s[i].fi;        ss[n-1-i] = ss[n-i]+s[n-1-i].fi;    }    for (int i = 0; i < n; i++) {        if (sp[i] <= u && ss[n-1-i] >= l) {            vector<int> v;            long long sum = 0;            for (int j = 0; j <= i; j++) {                v.push_back(s[j].se);                sum += s[j].fi;            }            for (int j = 0; j <= i; j++) {                if (sum < l) {                    sum -= s[j].fi;                    sum += s[n-1-j].fi;                    v[j] = s[n-1-j].se;                }            }            return v;        }    }    return vector<int>(0);}

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