ACM-ICPC 2018 南京赛区网络预赛 E. AC Challenge

题意：有n个题，完成第i个题的前置技能是完成它要求的si个题，有点拓扑排序的味道

---

题解：显然贪心不对，由于n比较小（n<=20)可以考虑状压dp，压缩每个状态，然后通过题目中所给出的条件判断当前状态可以由哪个状态合法的转移过来

---

AC代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(ll i = a; i <= b; i++)
#define per(i, a, b) for(ll i = a; i >= b; i--)
#define met(a, b) memset(a, b, sizeof(a))
#define pb push_back
const int maxn = 3e6;
const ll inf = 1e18;

struct PROBLEM {
    int a, b, s;
    int h;
} p[21];

ll dp[maxn];

bool judge(int x, int j) {
    rep(i, 0, 20) {
        if((1 << i) & x) {
            if(p[i].h & (1 << j)) return false;
        }
    }
    return true;
}

int main() {

    int T, n, d;
    scanf("%d", &n);
    rep(i, 0, n - 1) {
        p[i].h = 0;
        scanf("%d%d%d", &p[i].a, &p[i].b, &p[i].s);
        rep(j, 1, p[i].s) scanf("%d", &d), p[i].h += (1 << (d - 1));
    }
    met(dp, 0);
    int cnt = 0;
    ll ans = 0;
    for(int i = 1; i <= ((1 << n) - 1); i++) {
        cnt = 0;
        rep(j, 0, n - 1) if(i & (1 << j)) cnt++;
        rep(j, 0, n - 1) {
            if((i & (1 << j))) {
                if((((i - (1 << j)) & p[j].h) == p[j].h) && judge(i - (1 << j), j)) {
                    dp[i] = max(dp[i], dp[i - (1 << j)] + cnt * p[j].a + p[j].b);
                }
                ans = max(ans, dp[i]);
                //cout << ans << endl;
            }
        }
    }
    printf("%lld\n", ans);
    return 0;
}
/*****
5
5 6 0
4 5 1 1
3 4 1 2
2 3 1 3
1 2 1 4

55
*****/

/*****
1
-100 0 0

0
*****/