Submission #636095

#	Time	Username	Problem	Language	Result	Execution time	Memory
636095		nehasane	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	212 KiB

molecules

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

vector<int> find_subset(int l, int u, vector<int> w) {
    
    vector <int> ans;
    int n = w.size(), p = 0;
    vector <pair <int, int>> wt(n);
    for (int i = 0; i < n; i++)
        wt[i] = {w[i], i};
    sort(wt.begin(), wt.end());
    long long sum = 0;
    for (int i = 0; i < n; i++) {
        if (sum + wt[i].first >= l) {
            p = i;
            break;
        }
        sum += wt[i].first;
        ans.push_back(wt[i].second);
    }
    for (int i = p; i < n; i++) {
        if (sum + wt[i].first >= l && sum + wt[i].first <= u) {
            ans.push_back(wt[i].second);
            sum += wt[i].first;
            break;
        }
    }
    if (sum < l)
        ans.clear();
    return ans;
}

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