Codeforces Gym 100676G Training Camp 状压dp

#include <map>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int INF = 999999999;

int n,m;

map<string, int> Map;

int w[20];

int prve[20];

void read() {
    cin >> n >> m;getchar();

    char _a[101];
    string _s, _t;
    int _num;
    int _len;
    for (int i=0; i<n; i++) {
        gets(_a);

        _len = strlen(_a);

        int k = 0;
        while(_a[k] < ‘0‘ || _a[k] > ‘9‘) k++;

        _a[k-1] = ‘\0‘;
        _s = (string) _a;

        _num = 0;
        while (k < _len && _a[k] >= ‘0‘ && _a[k] <= ‘9‘) {
            _num = _num * 10 + _a[k] - ‘0‘;
            k++;
        }

        Map[_s] = i;
        w[i] = _num;
    }

    for (int i=0; i<m; i++) {
        gets(_a);

        int k = 0;
        while (_a[k] != ‘-‘) k++;

        _a[k-1] = ‘\0‘;

        _s = (string) _a;
        _t = (string) (_a + k + 4);

        prve[Map[_t]] |= (1 << Map[_s]);
    }
}


int dp[(1<<18)+5];

void DP () {

    for (int s=0; s<(1<<n); s++) {

        int _num = 0;

        for (int i=0; i<n; i++) {
            _num += ((s >> i) & 1);
        }

        for (int i=0; i<n; i++) {
            int ss = s | (1 << i);

            if (((s >> i & 1) != 0) || ((s & prve[i]) != prve[i])) continue;

            if (_num == 0 && prve[i] == 0) {
                dp[ss] = w[i];
                continue;
            }

            dp[ss] = max(dp[ss], dp[s] + (_num + 1) * w[i]);
        }
    }

    cout << dp[(1<<n)-1] << endl;
}

void init() {
    Map.clear();
    fill(dp, dp + (1 << 18), -INF);
    memset(prve, 0, sizeof(prve));
}

int main () {
    int t;
    cin >> t ;
    while (t--) {
        init();
        read();
        DP();
    }
    return 0;
}