Submission #725451

#	Time	Username	Problem	Language	Result	Execution time	Memory
725451		AndrijaM	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	1 ms	596 KiB

molecules

#include <bits/stdc++.h>

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w)
{
    sort(w.begin(),w.end());
    int dp[(int)w.size()+1][u+1];
    memset(dp,-1,sizeof dp);
    int n=(int)w.size();
    vector<int>arr;
    int cap;
    for(int idx=0;idx<=n;idx++)
    {
        for(cap=0;cap<=u;cap++)
        {
            if(idx==0 || cap==0)
            {
                dp[idx][cap]=0;
            }
            else
            {
                int nt=0+dp[idx-1][cap];
                int t=0;
                if(w[idx-1]<=cap)
                {
                    t=w[idx-1]+dp[idx-1][cap-w[idx-1]];
                }
                dp[idx][cap]=max(nt,t);
            }
        }
    }
    int rez=dp[n][u];
    if(rez<l || rez>u)
    {
        return {};
    }
    for(int i=n;i>0 && rez>0;i--)
    {
        if(rez==dp[i-1][cap])
        {
            continue;
        }
        arr.push_back(i-1);
        rez-=w[i-1];
        cap-=w[i-1];
    }
    return arr;
}

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