제출 #574071

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
574071		Elias	Detecting Molecules (IOI16_molecules)	C++17	10 / 100	1 ms	300 KiB

molecules

#include <bits/stdc++.h>

#ifndef _DEBUG
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include "molecules.h"
#endif

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w)
{

    vector<int> a;

    for (int x : w)
    {
        if (x > u)
            continue;
        if (x >= l)
            return {x};
        a.push_back(x);
    }

    int n = a.size();

    vector<vector<bool>> dp(n + 1, vector<bool>(u + 1));

    for (int i = 0; i <= n; i++)
        dp[i][0] = 1;

    int i, j;

    for (i = 1; i <= n; i++)
        for (j = 1; j <= u; j++)
        {
            dp[i][j] = dp[i - 1][j];

            if (a[i - 1] <= j)
                dp[i][j] = dp[i][j] | dp[i - 1][j - a[i - 1]];

            if (j >= l && j <= u && dp[i][j])
                goto out;
        }

    return {};

out:

    vector<int> o;

    while (i)
    {
        if (!dp[i - 1][j])
        {
            o.push_back(i - 1);
            j -= a[i - 1];
        }
        i--;
    }

    return o;
}

#ifdef _DEBUG

signed main()
{
    int n, l, u;
    cin >> n >> l >> u;

    vector<int> a(n);

    for (int &x : a)
        cin >> x;

    for (int x : find_subset(l, u, a))
        cout << x << " ";
}

#endif

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