CodeForces 518B. Tanya and Postcard

B. Tanya and Postcard

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Tanya decided to present her dad a postcard on his Birthday. She has already created a message — string s of length n, consisting of uppercase and lowercase English letters. Tanya can't write yet, so she found a newspaper and decided to cut out the letters and glue them into the postcard to achieve string s. The newspaper contains string t, consisting of uppercase and lowercase English letters. We know that the length of string t greater or equal to the length of the string s.

The newspaper may possibly have too few of some letters needed to make the text and too many of some other letters. That's why Tanya wants to cut some n letters out of the newspaper and make a message of length exactly n, so that it looked as much as possible like s. If the letter in some position has correct value and correct letter case (in the string s and in the string that Tanya will make), then she shouts joyfully "YAY!", and if the letter in the given position has only the correct value but it is in the wrong case, then the girl says "WHOOPS".

Tanya wants to make such message that lets her shout "YAY!" as much as possible. If there are multiple ways to do this, then her second priority is to maximize the number of times she says "WHOOPS". Your task is to help Tanya make the message.

Input

The first line contains line s (1 ≤ |s| ≤ 2·10⁵), consisting of uppercase and lowercase English letters — the text of Tanya's message.

The second line contains line t (|s| ≤ |t| ≤ 2·10⁵), consisting of uppercase and lowercase English letters — the text written in the newspaper.

Here |a| means the length of the string a.

Output

Print two integers separated by a space:

• the first number is the number of times Tanya shouts "YAY!" while making the message,
• the second number is the number of times Tanya says "WHOOPS" while making the message.

Sample test(s)

Input

AbC
DCbA

Output

3 0

Input

ABC
abc

Output

0 3

Input

abacaba
AbaCaBA

Output

3 4

这道题目的意思很好理解。
第一种情况，你要的字符串和报纸上的字符串有多少相同的，每个字母相同的个数累加起来再输出。
第二种情况，你要的字符串和报纸上的字符串有多少值相同，但大小写不同，将每个字母的情况累加起来再输出。

在样例里有这样的情况
ZZZzzz
ZZZZzz

答案是:5 1

也就是说，在你统计完第一种情况后，一样的字母需要你减去，然后才能去统计第二种情况。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <ctype.h>
#include <queue>
#define mem(a, b) memset((a), (b), (sizeof(a)))
using namespace std;
const int max_size = 200000 + 10;
char str1[max_size];
char str2[max_size];
int cnt1[60];
int cnt2[60];

int main()
{
    gets(str1);
    gets(str2);
    int len1 = strlen(str1);
    int len2 = strlen(str2);
    mem(cnt1, 0);
    mem(cnt2, 0);

    for(int i = 0; i < len1; i++)
    {
        cnt1[str1[i] - 'A']++;
    }
    for(int i = 0; i < len2; i++)
    {
        cnt2[str2[i] - 'A']++;
    }

    int ans1, ans2;
    ans1 = ans2 = 0;

    for(int i = 0; i < 60; i++)
    {
        int ans = min(cnt1[i], cnt2[i]);
        cnt1[i] -= ans;
        cnt2[i] -= ans;
        ans1 += ans;
    }

    for(int i = 0; i < 26; i++)
    {
        int ans = min(cnt1[i], cnt2[i+'a'-'A']) + min(cnt2[i], cnt1[i+'a'-'A']);
        ans2 += ans;
    }
    cout << ans1 << " " << ans2 << endl;
    return 0;
}