Submission #867492

#	Time	Username	Problem	Language	Result	Execution time	Memory
867492		lolismek	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	1 ms	348 KiB

molecules

#include "molecules.h"

#include <algorithm>
#include <iostream>
#include <queue>
#include <cassert>

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w){
    queue <int> dq;
    long long sum = 0;

    sort(w.begin(), w.end());

    for(int i = 0; i < (int)w.size(); i++){
        sum += w[i];
        dq.push(i);

        if(l <= sum && sum <= u){
            break;
        }

        while(!dq.empty() && sum > u){
            sum -= w[dq.front()];
            dq.pop();
        }
    }

    if(sum < l || sum > u){
        return vector <int>(0);
    }

    vector <int> ans;
    while(!dq.empty()){
        ans.push_back(dq.front());
        dq.pop();
    }

    return ans;
}

/*
4 15 17
6 8 8 7
*/

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