1.题目描述:点击打开链接
2.解题思路:其实我的思路想复杂了,把映射转化成字符串,再比较个数是否相同。这道题只需排序后依次比较对应项是否相等就行。AC了之后看了别人的代码才发现如此简单。。。下面贴出我的代码和别人的代码。
3.代码:
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<string>
#include<sstream>
#include<set>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<cassert>
#include<cstdlib>
#include<ctime>
#include<functional>
using namespace std;
const int maxn = 500000 + 10;
int n;
map<string, int>stu;
map<string, string>fnd;
int main()
{
while (cin >> n,n)
{
stu.clear();
fnd.clear();
int flag = 1;
for (int i = 0; i < n; i++)
{
string x, y;
string buf,cbuf;
cin >> x >> y;
buf.append(x);
buf.append("#");
buf.append(y);
cbuf.append(y);
cbuf.append("#");
cbuf.append(x);
if (!stu.count(buf))
stu[buf] = 0;
stu[buf]++;
fnd[buf] = cbuf;
}
for (map<string, int>::iterator it = stu.begin(); it != stu.end(); it++)
{
string sd;
sd = fnd[(*it).first];
if (!stu.count(sd) || stu[(*it).first] != stu[sd])
{
flag = 0;
break;
}
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
别人的代码
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,a[500000],b[500000],flag;
while(cin>>n&&n)
{
flag=1;
for(int i=0;i<n;i++)
cin>>a[i]>>b[i];
sort(a,a+n);
sort(b,b+n);
for(int i=0;i<n;i++)
if(a[i]!=b[i]) {flag=0;break;}
if(flag==1) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}