APAT_crossingblocks.rtf

{\rtf1\ansi\ansicpg1252\deff0\nouicompat\deflang16393{\fonttbl{\f0\fnil\fcharset0 Calibri;}}
{\*\generator Riched20 10.0.14393}\viewkind4\uc1 
\pard\sa200\sl276\slmult1\f0\fs22\lang9 #include <bits/stdc++.h>\par
using namespace std;\par
\par
#define ll long long int\par
#define pb push_back\par
#define pf push_front\par
#define f first\par
\par
struct edge \{\par
    ll A;\par
    ll B;\par
\};\par
\par
bool edgecompare(edge lhs, edge rhs) \{ if(lhs.B!=rhs.B)return lhs.B < rhs.B;\par
else return lhs.A<rhs.A;\}\par
\par
int main()\par
\{\par
    ios_base::sync_with_stdio(false);\par
    cin.tie(NULL);\par
    ll t;\par
    cin>>t;\par
    ll b[1000];\par
    b[1]=1;\par
    b[2]=2;\par
    for(ll bg=3;bg<=30;bg++)\par
    \{\par
        b[bg]=b[bg-1]+b[bg-2];\par
    \}\par
\par
    while(t--)\par
\{\par
    ll n,m,j,i,k,flag=0,a[1000];\par
    string str;\par
    map<ll , ll > Map;\par
    ll s1=0,s2=0;\par
    set<ll,greater<ll> >  :: iterator itr;\par
    cin>>n;\par
\par
    for(i=0;i<n;i++)\par
    \{\par
    \tab cin>>a[i];\par
    \}\par
\par
    i=0;j=n-1;k=0;s1=0;s2=0;\par
 \par
    while(i<=j)\par
    \{\par
        if(a[i]>=a[j])\par
        \{\par
           \par
            if(k%2==0)\par
            \{s1+=b[a[i]];\}\par
            else\par
              \{  s2+=b[a[i]];\}\par
               i++;\par
                \par
               \par
        \}\par
        else\par
        \{\par
\par
            \par
            if(k%2==0)\par
            s1+=b[a[j]];\par
            else\par
                s2+=b[a[j]];\par
                j--;\par
\par
        \}\par
        k++;\par
    \}\par
\par
    if(s1>s2)\par
        cout<<"First\\n";\par
    else if(s1==s2)\par
        cout<<"Tie\\n";\par
    else\par
        cout<<"Second\\n";\par
\par
\par
\}\par
   return 0;\par
\}\par
}