POJ 3128 Leonardo's Notebook（置换的平方）

Leonardo's Notebook Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2382   Accepted: 1008 Description — I just bought Leonardo's secret notebook! Rare object collector Stan Ucker was really agitated but his friend, special investigator Sarah Kepticwas unimpressed.  — How do you know it is genuine?  — Oh, it must be, at that price. And it is written in the da Vinci code. Sarah browsed a few of the pages. It was obvious to her that the code was a substitution cipher, where each letter of the alphabet had been substituted by another letter.  — Leonardo would have written the plain-text and left it to his assistant to encrypt, she said. And he must have supplied the substitution alphabet to be used. If we are lucky, we can find it on the back cover! She turned up the last page and, lo and behold, there was a single line of all 26 letters of the alphabet:  QWERTYUIOPASDFGHJKLZXCVBNM  — This may be Leonardo's instructions meaning that each A in the plain-text was to be replaced by Q, each B withW, etcetera. Let us see... To their disappointment, they soon saw that this could not be the substitution that was used in the book. Suddenly, Stan brightened.  — Maybe Leonardo really wrote the substitution alphabet on the last page, and by mistake his assistant coded that line as he had coded the rest of the book. So the line we have here is the result of applying some permutation TWICE to the ordinary alphabet! Sarah took out her laptop computer and coded fiercely for a few minutes. Then she turned to Stan with a sympathetic expression.  — No, that couldn't be it. I am afraid that you have been duped again, my friend. In all probability, the book is a fake.  Write a program that takes a permutation of the English alphabet as input and decides if it may be the result of performing some permutation twice.  Input The input begins with a positive number on a line of its own telling the number of test cases (at most 500). Then for each test case there is one line containing a permutation of the 26 capital letters of the English alphabet. Output For each test case, output one line containing Yes if the given permutation can result from applying some permutation twice on the original alphabet string ABC...XYZ, otherwise output No. Sample Input 2 QWERTYUIOPASDFGHJKLZXCVBNM ABCDEFGHIJKLMNOPQRSTUVWXYZ Sample Output No Yes Source Northwestern Europe 2006

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top

题意：给你一个置换，判断它是否是某个置换的平方。

题解：结论题：

循环节长度为奇数的置换平方后长度不变。

若其长度为偶数，平方以后一定分成了两个长度相等的循环。

因此我们只用判断循环长度为偶数的循环出现是否为偶数次就行了。

#include<set>      
#include<map>         
#include<stack>                
#include<queue>                
#include<vector>        
#include<string>     
#include<time.h>    
#include<math.h>                
#include<stdio.h>                
#include<iostream>                
#include<string.h>                
#include<stdlib.h>        
#include<algorithm>       
#include<functional>        
using namespace std;                
#define ll long long          
#define inf 1000000000         
#define mod 1000000007             
#define maxn  30   
#define lowbit(x) (x&-x)                
#define eps 1e-9 
int a[maxn],b[maxn];
char s[maxn];
int main(void)
{
	int T,i,j,len;
	scanf("%d",&T);
	while(T--)
	{
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		scanf("%s",s);
		len=strlen(s);
		for(i=0;i<len;i++)
		{
			if(a[i])
				continue;
			int now=i,num=0;
			while(!a[now])
			{
				num++;
				a[now]=1;
				now=s[now]-'A';
			}
			b[num]++;
		}
		int flag=1;
		for(i=1;i<=len;i++)
			if(i%2==0 && b[i]%2)
			{
				flag=0;
				break;
			}
		if(flag)
			printf("Yes\n");
		else
			printf("No\n");
	}
	return 0;
}