Codeforces 761C-Dasha and Password

Dasha and Password

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

After overcoming the stairs Dasha came to classes. She needed to write a password to begin her classes. The password is a string of length n which satisfies the following requirements:

• There is at least one digit in the string,
• There is at least one lowercase (small) letter of the Latin alphabet in the string,
• There is at least one of three listed symbols in the string: '#', '*', '&'.

Considering that these are programming classes it is not easy to write the password.

For each character of the password we have a fixed string of length m, on each of these n strings there is a pointer on some character. The i-th character displayed on the screen is the pointed character in the i-th string. Initially, all pointers are on characters with indexes 1 in the corresponding strings (all positions are numbered starting from one).

During one operation Dasha can move a pointer in one string one character to the left or to the right. Strings are cyclic, it means that when we move the pointer which is on the character with index 1 to the left, it moves to the character with the index m, and when we move it to the right from the position m it moves to the position 1.

You need to determine the minimum number of operations necessary to make the string displayed on the screen a valid password.

Input

The first line contains two integers n, m (3 ≤ n ≤ 50, 1 ≤ m ≤ 50) — the length of the password and the length of strings which are assigned to password symbols.

Each of the next n lines contains the string which is assigned to the i-th symbol of the password string. Its length is m, it consists of digits, lowercase English letters, and characters '#', '*' or '&'.

You have such input data that you can always get a valid password.

Output

Print one integer — the minimum number of operations which is necessary to make the string, which is displayed on the screen, a valid password.

Examples

input

3 4
1**2
a3*0
c4**

output

1

input

5 5
#*&#*
*a1c&
&q2w*
#a3c#
*&#*&

output

3

Note

In the first test it is necessary to move the pointer of the third string to one left to get the optimal answer.

In the second test one of possible algorithms will be:

• to move the pointer of the second symbol once to the right.
• to move the pointer of the third symbol twice to the right.

题意：有n行m列的字符，一个类似密码锁的东西。一开始的时候每行密码设置在第一列，可以通过拨动（向左移或向右移）来改变每一行的密码。合法的密码必须满足三个条件：①至少有一个数字。②至少有一个小写字母。③至少有一个特殊字符（*&#），问最少拨动多少下就能得到合法的密码。

解题思路：用数组保存每一行中达到每个条件最少的步骤，然后暴力枚举每个条件在哪一行

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

#define LL long long
const int INF=0x3f3f3f3f;

int n,m;
char ch[100][100];
int visit[100][3];

int main()
{
    while(~scanf("%d %d",&n,&m))
    {
        memset(visit,INF,sizeof visit);
        for(int i=1;i<=n;i++)
        {
            scanf("%s",ch[i]+1);
            for(int j=1;j<=m;j++)
            {
                if(ch[i][j]>='0'&&ch[i][j]<='9') visit[i][0]=min(visit[i][0],min(j,m+2-j));
                else if(ch[i][j]>='a'&&ch[i][j]<='z') visit[i][1]=min(visit[i][1],min(j,m+2-j));
                else visit[i][2]=min(visit[i][2],min(j,m+2-j));
            }
        }
        int ans=INF;
        for(int i=1;i<=n;i++)
        {
            if(visit[i][0]==INF) continue;
            for(int j=1;j<=n;j++)
            {
                if(i==j||visit[j][1]==INF) continue;
                for(int k=1;k<=n;k++)
                {
                    if(i==k||j==k||visit[k][2]==INF) continue;
                    ans=min(ans,visit[i][0]+visit[j][1]+visit[k][2]-3);
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}