<JZOJ5912>VanUSee

挺魔的

反正我考场上想不到233333333333333

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define rint register int
using std::sort;
using std::cin;
template <class T>inline void read(T &X)
{
    X=;int W=;char ch=;
    while(!isdigit(ch))W|=ch=='-',ch=getchar();
    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();
    X=W?-X:X;return;
}
int n,m,t,tot1,tot2;
int ou[],next[],ji[],tmp;
char S[],T[];
bool ok1,ok2,ok;
int main()
{
    freopen("vanusee.in","r",stdin);
    freopen("vanusee.out","w",stdout);
    read(t);
    while (t--)
    {
        ok1=ok2=ok=;
        cin>>S+;
        cin>>T+;
        n=strlen(S+),m=strlen(T+);
        tot1=tot2=;
        for (rint i=,j=;i<=m;i++)
        {
            while (T[i]!=T[j+]&&j) j=next[j];
            if (T[i]==T[j+]) j++;
            next[i]=j;
        }
        for (rint i=,j=;i<=n;i++)
        {
            while (S[i]!=T[j+]&&j) j=next[j];
            if (S[i]==T[j+]) j++;
            if (j==m)
            {
                tmp=n-i+m-i;
                if (!((n-m)%)) ou[++tot1]=tmp;
                else ji[++tot2]=tmp;
                j=next[j];
            }
        }
        if ((n-m)%)
        {
            sort(ji+,ji+tot2+);
            for(rint i=;i<=tot2;i++)
                if(ji[i]-ji[i-]==) ou[++tot1]=ji[i]-;
        }
        for (rint i=;i<=tot1;i++)
        {
            if (!ou[i]){ok=;break;}
            if (ou[i]==) ok1=;
            if (ou[i]==-) ok2=;
        }
        if (ok) {printf("pty\n");continue;}
        if (!ok1 || !ok2) printf("cqf\n");
        else printf("pty\n");
    }
}