Submission #285666

#	Time	Username	Problem	Language	Result	Execution time	Memory
285666		SamAnd	Detecting Molecules (IOI16_molecules)	C++17	31 / 100	1085 ms	684 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const int N = 10004;

int n;
int a[N];

bitset<N> dp[N], p[N];

std::vector<int> find_subset(int l, int r, std::vector<int> w)
{
    n = sz(w);
    for (int i = 1; i <= n; ++i)
        a[i] = w[i - 1];

    vector<pair<int, int> > v;
    for (int i = 1; i <= n; ++i)
        v.push_back(m_p(a[i], i - 1));
    sort(all(v));
    for (int i = -1; i < n; ++i)
    {
        for (int j = i + 1; j <= n; ++j)
        {
            ll s = 0;
            for (int k = 0; k < i; ++k)
                s += v[k].fi;
            for (int k = j; k < n; ++k)
                s += v[k].fi;
            if (l <= s && s <= r)
            {
                vector<int> ans;
                for (int k = 0; k < i; ++k)
                    ans.push_back(v[k].se);
                for (int k = j; k < n; ++k)
                    ans.push_back(v[k].se);
                return ans;
            }
        }
    }
    return {};

    dp[0][0] = true;
    for (int i = 1; i <= n; ++i)
    {
        int x = a[i];
        for (int j = 0; j <= r - x; ++j)
        {
            if (dp[i - 1][j])
            {
                dp[i][j + x] = true;
                p[i][j + x] = true;
            }
        }
        for (int j = 0; j <= r; ++j)
        {
            if (dp[i - 1][j])
            {
                dp[i][j] = true;
                p[i][j] = false;
            }
        }
    }
    for (int j = l; j <= r; ++j)
    {
        if (dp[n][j])
        {
            vector<int> ans;
            int x = j;
            for (int i = n; i >= 1; --i)
            {
                if (p[i][x])
                {
                    ans.push_back(i - 1);
                    x -= a[i];
                }
            }
            return ans;
        }
    }
    return {};
}

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