POJ 3128 Leonardo's Notebook

话说最近经常1Y啊，哈哈哈~又看了好多遍。。嗯，确实是accepted

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long i64;
#define out64 "%lld\n"
#define in64 "%lld"
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FFF(i,a)        for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxc = 26;

int a[maxc];
bool vis[maxc];
vector<int>v;

bool can()
{
    int temp;
    int num;
    v.clear();
    MM(vis,false);
    for(int i=0;i<maxc;i++)
    {
        if(!vis[i])
        {
            num = 0;
            temp = i;
            while(!vis[temp])
            {
                vis[temp]=true;
                num++;
                temp=a[temp];
            }
            v.push_back(num);
        }
    }
    sort(v.begin(),v.end());
    while(!v.empty())
    {
        if(v.back()%2!=0)
        {
            v.pop_back();
        }
        else if(v.size()==1)
        {
            return false;
        }
        else if(v[v.size()-2]==v.back())
        {
            v.pop_back();
            v.pop_back();
        }
        else
        {
            return false;
        }
    }
    return true;
}

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        char c;
        for(int i=0;i<maxc;i++)
        {
            cin>>c;
            a[i]=c-'A';
        }
        if(can())
        {
            cout<<"Yes"<<endl;
        }
        else
        {
            cout<<"No"<<endl;
        }
    }
    return 0;
}