Submission #1360066

#TimeUsernameProblemLanguageResultExecution timeMemory
1360066skuruDetecting Molecules (IOI16_molecules)C++20
31 / 100
53 ms131072 KiB
#include "molecules.h"
#include <bitset>
using namespace std;

#define all(v) (v).begin(), (v).end()

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();

    vector<bitset<505050>> dp(n);
    dp[0][0] = dp[0][w[0]] = true;

    for (int i = 1; i < n; i++) {
        dp[i] = dp[i - 1];
        
        for (int j = w[i]; j <= u; j++) {
            if (j - w[i] >= 0 and dp[i - 1][j - w[i]])
                dp[i][j] = true;
        }
    }
    
    int j = l;
    for (; j <= u; j++) {
        if (dp[n - 1][j])
            break;
    }
    if (j > u)
        return {};
    
    vector<int> ret;
    for (int i = n - 1; i != 0; i--) {
        if (dp[i - 1][j])
            continue;
        j -= w[i];
        ret.push_back(i);
    }
    if (j != 0)
        ret.push_back(0);
    
    return ret;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...