題意
給你n道題，在你做第${i}$道題的時候有 p[j] $p[j]$

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define int long long
using namespace std;
int a[22] , b[22] , z[22];
int num[1<<22] , dp[1<<22]; 
void init()
{
    memset(num,0,sizeof(num));
    for(int i = 1 ; i <= (1<<22) ; i++) num[i] = 1 + num[i&(i-1)]; // 預處理出所有狀態中1的數量
}
signed main()
{
    int n , c;
    init();
    scanf("%lld",&n);
    for(int i = 0 ; i < n ; i++)
    {
        scanf("%lld%lld%lld",&a[i],&b[i],&c);
        int state = 0 , t;
        for(int j = 0 ; j < c ; j++)
        {
            scanf("%lld",&t);
            state = state | (1<<(t-1));
        }
        z[i] = state; // z[i]表示的是做第i道題的前置條件
    }
    memset(dp,-INF,sizeof(dp));
    dp[0] = 0;
    int ans = 0;
    for(int state = 0 ; state < (1<<n)  ; state++)
    {
        if(dp[state] == -INF) continue;
        ans = max(ans,dp[state]);
        for(int j = 0 ; j < n ;j++)
        {
            if(state & (1<<j)) continue;
            if((state & z[j]) != z[j]) continue; //當他的所有前置條件都滿足的情況下
            dp[state|(1<<j)] = max(dp[state|(1<<j)] , dp[state] + (num[state]+1)*a[j] + b[j]); 
        }
    }
    cout<<ans<<endl;
}