B. Tanya and Postcard
time limit per test
memory limit per test
input
output
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.
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".
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
s (1 ≤ |s| ≤ 2·105), consisting of uppercase and lowercase English letters — the text of Tanya's message.
t (|s| ≤ |t| ≤ 2·105), consisting of uppercase and lowercase English letters — the text written in the newspaper.
|a| means the length of the string a.
Output
Print two integers separated by a space:
- YAY!" while making the message,
- 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<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (2000000)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
char s[MAXN],t[MAXN];
int f[MAXN]={0};
int main()
{
freopen("Invitation.in","r",stdin);
// freopen(".out","w",stdout);
scanf("%s%s",s,t);
int n1=strlen(s),n2=strlen(t);
Rep(i,n2) f[t[i]]++;
int p=0;
Rep(i,n1)
{
if (f[s[i]]>0) f[s[i]]--,p++,s[i]=0;
}
cout<<p<<' ';
int p2=0;
Rep(i,n1)
if (s[i])
{
if ('a'<=s[i]&&s[i]<='z'&&f[s[i]-'a'+'A'])
f[s[i]-'a'+'A']--,p2++;
if ('A'<=s[i]&&s[i]<='Z'&&f[s[i]-'A'+'a'])
f[s[i]-'A'+'a']--,p2++;
}
cout<<p2<<endl;
return 0;
}
