C++14(g++5.4) 解法, 执行用时: 5ms, 内存消耗: 1380K, 提交时间: 2019-04-13 14:07:11

#include <bits/stdc++.h>
using namespace std;
char ch;
char s1[2005][2005], s2[2005][2005];
int num = 0;
map<string, int>mp;
int main()
{
	int cnt1 = 0, cnt2 = 0;
	for (int i = 0; true; i++)
	{
		scanf("%s%c", s1[i], &ch);
		for (int j = 0; j < strlen(s1[i]); j++)
			s1[i][j] = tolower(s1[i][j]);
		mp[s1[i]] = 1;
		cnt1++;
		if (ch == '\n')
			break;
	}
	for (int i = 0; true; i++)
	{
		scanf("%s%c", s2[i], &ch);
		for (int j = 0; j < strlen(s2[i]); j++)
			s2[i][j] = tolower(s2[i][j]);
		if (mp[s2[i]] != 0)
			num++;
		cnt2++;
		if (ch == '\n')
			break;
	}
	double ans = 0;
	ans = num * 1.0 / sqrt(cnt1 * 1.0) / sqrt(1.0 * cnt2);
	if (ans >= 0.90)
		printf("Yes");
	else
		printf("No");
}

C++11(clang++ 3.9) 解法, 执行用时: 5ms, 内存消耗: 600K, 提交时间: 2019-04-18 12:44:06

#include <string>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <map>
#include <cmath>
using namespace std;
typedef pair<int,int> P;
stringstream stream;
map<string,P> map1;
string s1,str;
double x1=0,x2=0,x3=0;
void analyse(int d){
	getline(cin,s1);
	transform(s1.begin(),s1.end(),s1.begin(),::tolower);
	stream<<s1;
	while(stream>>str)	d==1?map1[str].first++:map1[str].second++;
	stream.clear();
	return;
}
int main(){
	analyse(1);
	analyse(2);	
	for(auto c:map1){
		x1+=c.second.first*c.second.second;
		x2+=pow(c.second.first,2);x3+=pow(c.second.second,2);
	}
	if(x1/sqrt(x2*x3)>=0.9)	cout<<"Yes"<<endl;
	else	cout<<"No"<<endl;
	return 0;
}