제출 #265605

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
265605		amalla	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	1084 ms	51064 KiB

molecules

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

using namespace std;

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

bitset<10000> DP(int i, int sum, bitset<10000> choosen) {
    if (sum>U) return INF;
    if (sum>=L) return choosen;
    if (i == N) return INF;
    if (vis[sum]) return memo[sum];
    
    bitset<10000> 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[sum] = res;
    vis[sum] = true;
    return memo[sum];
}

vector<int> find_subset(int l, int u, vector<int> w) {
    N = w.size(); L = l; U = u; W = w;
    bitset<10000> 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