Submission #1341358

#	Time	Username	Problem	Language	Result	Execution time	Memory
1341358		kantaponz	Detecting Molecules (IOI16_molecules)	C++20	100 / 100	39 ms	11028 KiB

molecules

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

#define ll long long

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n;
    vector<pair<ll,int>> v;
    n = w.size();
    for (int i = 0; i < n; i++) {
        v.emplace_back(w[i], i);
    }
    ll sum = 0;
    sort(v.begin(), v.end());
    vector<int> ans;
    priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<pair<ll,int>>> pq;
    int i = 0;
    
    while (i < n) {
        while (i < n && sum < l) {
            auto [w, idx] = v[i];
            pq.emplace(w, idx);
            sum += w;
            i++;
        }
        if (sum >= l && sum <= u) {
            while (!pq.empty()) {
                auto [w, idx] = pq.top();
                pq.pop();
                ans.emplace_back(idx);
            }
            return ans;
        }
        
        while (!pq.empty() && sum > u) {
            sum -= pq.top().first;
            pq.pop();
        }
        if (sum >= l && sum <= u) {
            while (!pq.empty()) {
                auto [w, idx] = pq.top();
                pq.pop();
                ans.emplace_back(idx);
            }
            return ans;
        }
    }

    return ans;
}

/*
g++ grader.cpp molecules.cpp -o o


*/

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