CSL的英语考试(“新智认知”杯上海高校程序设计竞赛暨第十七届上海大学程序设计春季联赛)

Input
3
a b c d e f g h i j k l m n o p q r s t u v w x y z
world wolf
app apple
panda panda
output
>
<
=

题意：先给出询问次数，在给出新的字典序，判断每组样例中字符串的大小。

#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <deque>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int MAX=1e9+7;
struct A
{
    char s;
    ll r={0};
} a[30];
int main()
{
    ll T,e,i,j,k,ans=0,x,y,n;
    cin>>T;
    char s[30];
    for(i=0; i<26; i++)
    {
        cin>>a[i].s;
        a[i].r=i;
    }
    while(T--)
    {
        char s1[1010],s2[1010];
        cin>>s1>>s2;
        ll len1=strlen(s1);
        ll len2=strlen(s2);
        if(len1>len2)
        {
            ll h=0;
            for(i=0; i<len2; i++)
            {
                ll p=0,q=0;
                for(k=0; k<26; k++)
                {
                    if(s1[i]==a[k].s)
                        p=a[k].r;
                    if(s2[i]==a[k].s)
                        q=a[k].r;
                }
                if(p==q)
                {
                    h++;
                    continue;
                }
                else if(p<q)
                {
                    cout<<"<"<<endl;
                    break;
                }
                else
                {
                    cout<<">"<<endl;
                    break;
                }

            }
            if(h==len2)
                cout<<">"<<endl;
        }
        else
        if(len1<len2)
        {
            ll h=0;
            for(i=0; i<len1; i++)
            {
                ll p=0,q=0;
                for(k=0; k<26; k++)
                {
                    if(s1[i]==a[k].s)
                        p=a[k].r;
                    if(s2[i]==a[k].s)
                        q=a[k].r;
                }
                if(p==q)
                {
                    h++;
                    continue;
                }
                else if(p<q)
                {
                    cout<<"<"<<endl;
                    break;
                }
                else
                {
                    cout<<">"<<endl;
                    break;
                }
            }
            if(h==len1)
            {
                cout<<"<"<<endl;
            }
        }
        else
        {
            ll h=0;
            for(i=0; i<len1; i++)
            {
                ll p=0,q=0;
                for(k=0; k<26; k++)
                {
                    if(s1[i]==a[k].s)
                        p=a[k].r;
                    if(s2[i]==a[k].s)
                        q=a[k].r;
                }
                if(p==q)
                {
                    h++;
                    continue;
                }
                else if(p<q)
                {
                    cout<<"<"<<endl;
                    break;
                }
                else
                {
                    cout<<">"<<endl;
                    break;
                }
            }
            if(h==len1)
            {
                cout<<"="<<endl;
            }
        }
    }
    return 0;
}