Submission #218542

#TimeUsernameProblemLanguageResultExecution timeMemory
218542emil_physmathDetecting Molecules (IOI16_molecules)C++17
0 / 100
5 ms256 KiB
#include "molecules.h"
#include <algorithm>
#include <iostream>
#include <bitset>
#include <vector>
using namespace std;

bitset<10001> dp[10001], take[10001];

vector<int> find_subset(int l, int u, vector<int> a)
{
    int n = a.size();
    vector<pair<int, int> > w(n);
    for (int i = 0; i < n; ++i)
        w[i] = {a[i], i};
    sort(w.begin(), w.end(), greater<pair<int, int> >());
    vector<int> res;
    for (int i = 0, sum = w[0].first; i < n; sum += w[++i].first)
    {
        res.push_back(w[i].second);
        if (sum >= l)
            break;
    }
    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...