CF 518B(Tanya and Postcard-计数统计)
2015-02-25 15:01
417 查看
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
output
input
output
input
output
统计各个字母出现个数,贪心
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<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; }
相关文章推荐
- CF Tanya and Postcard
- CodeForces 518B. Tanya and Postcard
- 518B - Tanya and Postcard【哎还是string】
- Codeforces Round #293 (Div. 2) B. Tanya and Postcard 水题
- CF 518D(Ilya and Escalator-组合数太大,就直接拿去Dp)
- codeforces 518B. Tanya and Postcard 解题报告
- CF 288DIV2 D - Tanya and Password (弗罗莱算法求欧拉通路)
- CF 558B(Amr and The Large Array-计数)
- CF 518 D. Ilya and Escalator
- CF 390C - Inna and Candy Boxes(分类统计)
- CF 518 D. Ilya and Escalator 概率dp
- 【CF 508D】 Tanya and Password (判欧拉路+输出欧拉路径)
- Codeforces Round #293 (Div. 2) -- B. Tanya and Postcard
- 【打CF,学算法——二星级】Codeforces 703B Mishka and trip (统计)
- Codeforces Round #293 (Div. 2)——B——Tanya and Postcard
- CF 558B(Amr and The Large Array-计数)
- cf - #346 C-Tanya and Toys
- CF 518 E Arthur and Questions(贪心,模拟乱搞)
- CF D. Tanya and Password
- CF 205 CLittle Elephant and Interval 分类讨论(计数) D(暴力,水题)