Submission #716936

#	Time	Username	Problem	Language	Result	Execution time	Memory
716936		Desh03	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	1093 ms	50352 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> ans;
vector<pair<int, int>> v;
int n;
bool dp[10000][10001];
int lb, rb;
void recurse(int i, int sum, vector<int> k) {
    if (i == n) {
        if (sum >= lb && sum <= rb) ans = k;
        return;
    }
    if (dp[i][sum] || sum > rb || ans.size()) return;
    dp[i][sum] = 1;
    if (sum >= lb && sum <= rb) {
        ans = k;
        return;
    }
    recurse(i + 1, sum, k);
    k.push_back(v[i].second);
    recurse(i + 1, sum + v[i].first, k);
}
vector<int> find_subset(int l, int u, vector<int> w) {
    n = w.size();
    for (int i = 0; i < n; i++) v.push_back({w[i], i});
    sort(v.rbegin(), v.rend());
    lb = l, rb = u;
    recurse(0, 0, ans);
    return ans;
}

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