堆判断

#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
#define INF 0x3f3f3f3f
using namespace std;
const int N=1e5+5;
typedef long long ll;
int a[2005];
int vis[30005];
int n,m,Size;
int main()
{
    a[0]=-10001;
    Size=0;
    scanf("%d%d",&n,&m);
    for(int i=0; i<n; i++)
    {
        int x;
        scanf("%d",&x);
        int j=++Size;
        for(; a[j>>1]>x; j>>=1)
            a[j]=a[j>>1];
        a[j]=x;
    }
    for(int i=1; i<=Size; i++)
        vis[a[i]+10000]=i;
    char s[25];
    while(m--)
    {
        int num,num1;
        scanf("%d",&num);
        scanf("%s",s);
        num+=10000;
        if(s[0]=='i')
        {
            scanf("%*s%s",s);
            if(s[0]=='r')
                puts(vis[num]==1?"T":"F");
            else
            {
                scanf("%*s%d",&num1);
                num1+=10000;
                if(s[0]=='p')puts(vis[num1]/2==vis[num]?"T":"F");
                else puts(vis[num]/2==vis[num1]?"T":"F");
            }
        }
        else
        {
            scanf("%d%*s%*s",&num1);
            num1+=10000;
            puts(vis[num]/2==vis[num1]/2?"T":"F");
        }
    }
}