Submission #819732

#	Time	Username	Problem	Language	Result	Execution time	Memory
819732		KemalK	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	39 ms	4460 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = w.size();
    vector <pair <int, int>> a(n);
    for (int i = 0; i < n; i++){
        a[i] = {w[i], i};
    }
    sort(a.begin(), a.end());
    queue <int> past;
    ll sum = 0;
    for (int i = 0; i < n; i++){
        sum += a[i].first;
        past.push(a[i].second);
        while(sum > u){
            sum -= w[past.front()];
            past.pop();
        }
        if (sum >= l){
            vector <int> ans;
            
            while(past.size() > 0){
                ans.push_back(past.front());
                past.pop();
            }
            return ans;
        }
    }
    return {};
}

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