Codeforces 744C Hongcow Buys a Deck of Cards 状压dp (看题解)

Hongcow Buys a Deck of Cards

啊啊啊, 为什么我连这种垃圾dp都写不出来。。 不是应该10分钟就该秒掉的题吗。。

从dp想到暴力然后gg， 没有想到把省下的红色开成一维。

#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define PLL pair<LL, LL>
#define PLI pair<LL, int>
#define PII pair<int, int>
#define SZ(x) ((int)x.size())
#define ull unsigned long long

using namespace std;

const int N = ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + ;
const double eps = 1e-;
const double PI = acos(-);

int n;
int c[N], r[N], b[N], R, B;
char s[];

int dp[ << N][];
int Sr[ << N], Sb[ << N];

int main() {
    scanf("%d", &n);
    for(int i = ; i < n; i++) {
        scanf("%s%d%d", s, &r[i], &b[i]);
        if(s[] == 'R') c[i] = ;
        else c[i] = ;
        R += r[i];
        B += b[i];
    }
    for(int S = ; S < ( << n); S++) {
        for(int i = ; i < n; i++)
            if(S >> i & ) Sr[S] += !c[i], Sb[S] += c[i];
    }
    int ans = inf;
    memset(dp, -, sizeof(dp));
    dp[][] = ;
    for(int S = ; S < ( << n); S++) {
        for(int i = ; i <= ; i++) {
            if(dp[S][i] == -) continue;
            for(int j = ; j < n; j++) {
                if(S >> j & ) continue;
                dp[S | ( << j)][i + min(r[j], Sr[S])] = max(dp[S | ( << j)][i + min(r[j], Sr[S])], dp[S][i] + min(b[j], Sb[S]));
            }
        }
        if(S == ( << n) - ) {
            for(int i = ; i <= ; i++) {
                if(dp[S][i] == -) continue;
                ans = min(ans, max(R - i, B - dp[S][i]) + n);
            }
        }
    }
    printf("%d\n", ans);
    return ;
}

/*
*/