Submission #264493

#	Time	Username	Problem	Language	Result	Execution time	Memory
264493		amalla	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	5 ms	1992 KiB

molecules

#include "molecules.h"
#include<bits/stdc++.h>

using namespace std;

#define ll long long
int N, L, U;
vector<int> W;
bitset<100> INF;
bitset<100> memo[100][1000];
bool vis[100][1000] = {0};

bitset<100> DP(int i, int sum, bitset<100> choosen) {
    if (sum>U) return INF;
    if (sum>=L) return choosen;
    if (i == N) return INF;
    if (vis[i][sum]) return memo[i][sum];

    bitset<100> res1, res2, res;
    choosen[i] = 1;
    res1 = DP(i+1, sum + W[i], choosen);
    choosen[i] = 0;
    res2 = DP(i+1, sum, choosen);

    if (res1.count()>res2.count()) res = res1;
    else res = res2;

    memo[i][sum] = res;
    vis[i][sum] = true;
    return memo[i][sum];    
}

vector<int> find_subset(int l, int u, vector<int> w) {
    N = w.size(); L = l; U = u; W = w;
    bitset<100> res = DP(0,0, INF);
    vector<int> Ans(res.count());
    for (int i = 0, j = 0; i<N; ++i) {
        if (res[i]) {
            Ans[j] = i;
            ++j;
        }
    }
    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