Submission #145956

#	Time	Username	Problem	Language	Result	Execution time	Memory
145956		alexandra_udristoiu	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	69 ms	8776 KiB

molecules

#include "molecules.h"
#include<algorithm>
#include<iostream>
#include<vector>
#define DIM 200005
#define f first
#define s second
using namespace std;
static long long sf[DIM], ss[DIM];
static vector<int> sol;
static pair<int, int> v[DIM];
vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size(), i, j, k = 0;
    for(i = 1; i <= n; i++){
        v[i] = make_pair(w[i - 1], i - 1);
    }
    sort(v + 1, v + n + 1);
    for(i = 1; i <= n; i++){
        sf[i] = sf[i - 1] + v[i].f;
    }
    for(i = n; i >= 1; i--){
        ss[i] = ss[i + 1] + v[i].f;
    }
    for(i = 1; i <= n; i++){
        if(sf[i] <= u && ss[n - i + 1] >= l){
            k = i;
            break;
        }
    }
    if(k == 0){
        return sol;
    }
    long long sum = 0;
    for(i = 1; i <= k; i++){
        sol.push_back(v[i].s);
        sum += v[i].f;
    }
    i = 1;
    j = n;
    while(sum < l){
        sum += v[j].f - v[i].f;
        sol[i - 1] = v[j].s;
        i++;
        j--;
    }
    sort(sol.begin(), sol.end());
    return sol;
}

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