Codeforces Round #293 (Div. 2) B. 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·105),
consisting of uppercase and lowercase English letters — the text of Tanya's message.

The second line contains line t (|s| ≤ |t| ≤ 2·105),
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

看清题意即可。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <queue>

using namespace std;
#define maxn 200005
#define inf 0x7ffffff
pair <int ,int > p;
char arr[maxn];
char brr[maxn];
int ca[150];
int cb[150];
int n;
int main()
{
gets(arr);
gets(brr);
int lena = strlen(arr);
int lenb = strlen(brr);
memset(ca,0,sizeof(ca));
memset(cb,0,sizeof(cb));
for(int i = 0; i < lena;i++){
ca[arr[i]] ++;
}
for(int i = 0; i < lenb;i++){
cb[brr[i]] ++;
}
int ans1 = 0;
int ans2 = 0;
for(int i = 'a'; i <= 'z';i++){
int tmp = min(ca[i],cb[i]);
ans1 += tmp;
ca[i] -= tmp;
cb[i] -= tmp;
tmp = min(ca[i-'a'+'A'],cb[i-'a'+'A']);
ans1 += tmp;
ca[i-'a'+'A'] -= tmp;
cb[i-'a'+'A'] -= tmp;
ans2 += min(ca[i],cb[i-'a'+'A']);
ans2 += min(cb[i],ca[i-'a'+'A']);
}
printf("%d %d\n",ans1,ans2);
return 0;
}