Codeforces Round #394 (Div. 2) Dasha and Password

一开始对字符串处理一下，记录该串提供特定类别所需要的步骤

然后dp，因为只有三种类别，用二进制来记录（0-7）

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int MAX = 2e2+10;
const int mod = 1e9+7;
int n, m;
int lxt[60][3];
int dp[60][10];
char s[60];
int f(char c)
{
    if(c>='0'&&c<='9')return 1;
    else if(c>='a'&&c<='z')return 2;
    else if(c=='*'||c=='#'||c=='&')return 3;
    return 0;
}
int main()
{
    cin>>n>>m;
    for(int i = 1; i<=n; ++i)
    {
        cin>>s;
        lxt[i][0] = lxt[i][1] = lxt[i][2] = 999;
        for(int j = 0; j<m; ++j)
        {
            if(f(s[j])==1)lxt[i][0] = min(lxt[i][0], min(j, (m-j)%m));
            else if(f(s[j])==2)lxt[i][1] = min(lxt[i][1], min(j,(m-j)%m));
            else if(f(s[j])==3)lxt[i][2] = min(lxt[i][2], min(j,(m-j)%m));
        }
    }
    for(int j = 1; j<=8; ++j)
            dp[0][j] = 999;
    dp[0][0] = 0;
    for(int i = 1; i<=n; ++i)
    {
        for(int j = 0; j<=7; ++j)
            dp[i][j] = dp[i-1][j];
        for(int k = 0; k<3; ++k)
        {
            int kk = 1<<k;
            if(lxt[i][k]==999)continue;
            for(int j = 0; j<=7; ++j)
                if(!(j&kk))dp[i][j+kk] = min(dp[i][j+kk], dp[i-1][j]+lxt[i][k]);
        }
    }
    cout<<dp[n][7]<<endl;
    return 0;
}