Codeforces #374（Div.2）B. Passwords【模拟】

B. Passwords

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vanya is managed to enter his favourite site Codehorses. Vanya uses n distinct passwords for sites at all, however he can't remember which one exactly he specified during Codehorses registration.

Vanya will enter passwords in order of non-decreasing their lengths, and he will enter passwords of same length in arbitrary order. Just when Vanya will have entered the correct password, he is immediately authorized on the site. Vanya will not enter any password twice.

Entering any passwords takes one second for Vanya. But if Vanya will enter wrong password k times, then he is able to make the next try only 5 seconds after that. Vanya makes each try immediately, that is, at each moment when Vanya is able to enter password, he is doing that.

Determine how many seconds will Vanya need to enter Codehorses in the best case for him (if he spends minimum possible number of second) and in the worst case (if he spends maximum possible amount of seconds).

Input

The first line of the input contains two integers n and k (1 ≤ n, k ≤ 100) — the number of Vanya's passwords and the number of failed tries, after which the access to the site is blocked for 5 seconds.

The next n lines contains passwords, one per line — pairwise distinct non-empty strings consisting of latin letters and digits. Each password length does not exceed 100 characters.

The last line of the input contains the Vanya's Codehorses password. It is guaranteed that the Vanya's Codehorses password is equal to some of his n passwords.

Output

Consider the first sample case. As soon as all passwords have the same length, Vanya can enter the right password at the first try as well as at the last try. If he enters it at the first try, he spends exactly 1 second. Thus in the best case the answer is 1. If, at the other hand, he enters it at the last try, he enters another 4 passwords before. He spends 2 seconds to enter first 2 passwords, then he waits 5 seconds as soon as he made 2 wrong tries. Then he spends 2 more seconds to enter 2 wrong passwords, again waits 5 seconds and, finally, enters the correct password spending 1 more second. In summary in the worst case he is able to be authorized in 15 seconds.

Examples

Input

5 2
cba
abc
bb1
abC
ABC
abc

Output

1 15

Input

4 100
11
22
1
2
22

Output

3 4

Note

Consider the second sample case. There is no way of entering passwords and get the access to the site blocked. As soon as the required password has length of 2, Vanya enters all passwords of length 1 anyway, spending 2 seconds for that. Then, in the best case, he immediately enters the correct password and the answer for the best case is 3, but in the worst case he enters wrong password of length 2 and only then the right one, spending 4 seconds at all.

 

题目大意：

一共有N个想要尝试的密码（当然保证一定有一个和正确密码相匹配），给你一个值K，表示错误了K次密码输入之后要等五秒之后继续下一次输入密码，输入密码用1S，问最快这个人可以几秒钟正确，最慢可以几秒钟正确，尝试密码的时候有一个顺序，必须按照字符串递增顺序来尝试。

思路:

1、定义一个结构体，其中三个元素，分别代表字符串是什么，长度，以及标记flag，flag=1表示这个字符串和密码相匹配，flag=0表示这个字符串和密码不匹配。

2、

那么对应最短时间：按照字符串长度排序，如果两个字符串长度相同，按照flag从大到小排序。

那么对应最长时间：按照字符串长度排序，如果两个字符串长度相同，按照flag从小到大排序。

3、排序之后模拟输入密码的过程即可。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
    int len;
    int flag;
    char s[105];
}a[105];
char dui[105];
int cmp(node a,node b)
{
    if(a.len!=b.len)
    return a.len<b.len;
    else return a.flag>b.flag;
}
int cmp2(node a,node b)
{
    if(a.len!=b.len)
    return a.len<b.len;
    else return a.flag<b.flag;
}
int main()
{
    int n,k;
    while(~scanf("%d%d",&n,&k))
    {
        for(int i=0;i<n;i++)
        {
            scanf("%s",a[i].s);
            a[i].len=strlen(a[i].s);
        }
        scanf("%s",dui);
        for(int i=0;i<n;i++)
        {
            if(strcmp(a[i].s,dui)==0)
            {
                a[i].flag=1;
            }
            else a[i].flag=0;
        }
        sort(a,a+n,cmp);
        int output1=0;
        int cont=0;
        for(int i=0;i<n;i++)
        {
            output1++;
            if(a[i].flag==1)break;
            if(a[i].flag==0)
            {
                cont++;
            }
            if(cont==k)
            {
                cont=0;
                output1+=5;
            }
        }
        printf("%d ",output1);
        sort(a,a+n,cmp2);
        cont=0;
        int output2=0;
        for(int i=0;i<n;i++)
        {
            output2++;
            if(a[i].flag==1)break;
            if(a[i].flag==0)
            {
                cont++;
            }
            if(cont==k)
            {
                cont=0;
                output2+=5;
            }
        }
        printf("%d\n",output2);
    }
}