3317854_ac_0ms_192k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <vector>
#include <algorithm>

using namespace std;

vector <int> len;

int main()
{
	int cas, cnt;
	char str[27];
	int i, j;
	int mark[27], flag;

	scanf("%d",&cas);
	while (cas-- > 0)
	{
		memset(mark,0,sizeof(mark));
		scanf("%s",str);
		len.clear();
		for(i = 0; i < 26; i++)
		{
			if(mark[i]==1)
				continue;
			j = i;
			cnt = 0;
			while(mark[j]==0)
			{
				mark[j] = 1;
				cnt++;
				j = str[j]-'A';
			}
			if(cnt%2==0)
			{
				len.push_back(cnt);
			}
		}
		flag = 1;
		sort(len.begin(),len.end());
		if(len.size()%2==1)
			flag = 0;
		for(i = 0; i < len.size(); i+=2)
		{
			if(len[i]!=len[i+1])
			{
				flag = 0;
				break;
			}
		}
		puts(flag?"Yes":"No");
	}
	return 0;
}