CodeForces 518B

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=120930#problem/B

B - Han Solo and Lazer Gun

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 518B

Description

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 Input

Input

AbC
DCbA

Output

3 0

Input

ABC
abc

Output

0 3

Input

abacaba
AbaCaBA

Output

3 4

题意:给出两个字符串s,t  从t中取出一些字母,使这些字母能够构成s,如果拼出的字符串与s在对应位置的值相同大小写不同则喊whoops如果值相同而且大小写相同则喊yay,给出两个串,输出喊yay和whoops的次数

思路:

20万*20万暴力超时;

使用两个数组a,b分别统计出s,t中各个字母出现的次数

        for(int i=0;s[i];i++)a[s[i]]++;
        for(int i=0;t[i];i++)b[t[i]]++;

( 另外学习 for(int i=0;s[i];i++) 的写法)

此题与字母的顺序无关,只与各个字母出现的次数有关,因为能从t中取出s所以,t中各个字母大小写的总数一定比s中的对应字母的大小写总数多,(但相同形式的不一定多)

遍历各个字母(A-Z,,,a-z..只需52次循环),取出并减去各个字母各个形式的最小值,相同形式的次数加在yay上不同形式的加在whoops上

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int maxn=200000+5;
char s[maxn],t[maxn];
int a[130],b[130];
int main(){
    while(~scanf("%s%s",s,t)){
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        int y=0,w=0,u;
        for(int i=0;s[i];i++)a[s[i]]++;
        for(int i=0;t[i];i++)b[t[i]]++;
        for(int i='a';i<='z';i++){
            u=min(a[i],b[i]);
            a[i]-=u; b[i]-=u;
            y+=u;
        }
        for(int i='A';i<='Z';i++){
            u=min(a[i],b[i]);
            a[i]-=u; b[i]-=u;
            y+=u;
        }for(int i='a';i<='z';i++){
            u=min(a[i],b[i-32]);
            a[i]-=u; b[i-32]-=u;
            w+=u;
        }
        for(int i='A';i<='Z';i++){
            u=min(a[i],b[i+32]);
            a[i]-=u; b[i]-=u;
            w+=u;
        }

        printf("%d %d",y,w);



    }
    return 0;
}