团体程序设计天梯赛-练习集 - L2-012 关于堆的判断（25 分）

#include<bits/stdc++.h>#include<cmath>#define mem(a,b) memset(a,b,sizeof a)#define ssclr(ss) ss.clear(), ss.str("")#define INF 0x3f3f3f3f#define MOD 1000000007usingnamespacestd;
typedeflonglongll;
intn, res, a[1009];
voidfind_heap(intrt, intd)
{
if(rt>n||rt<=0) return;
if(a[rt]==d){res=rt; return;}
if(a[rt]<d) find_heap(rt*2,d);
if(a[rt]<d) find_heap(rt*2+1,d);
}
intmain()
{
intm,n1,n2,rt;
scanf("%d%d",&n,&m);
for(inti=1;i<=n;i++)
    {
scanf("%d",&a[i]);
make_heap(a+1,a+1+i,greater<int>());
    }
rt=a[1];
getchar();
strings;
while(m--)
    {
getline(cin,s);
intf=0, id1, id2;
if(sscanf(s.c_str(),"%d and %d are siblings",&n1,&n2)==2)
        {
res=0; find_heap(1,n1); id1=res;
res=0; find_heap(1,n2); id2=res;
if(id1>id2) swap(id1,id2);
if(id1%2==0&&id2%2==1&&id2-id1==1) f=1;
        }
elseif(sscanf(s.c_str(),"%d is the parent of %d",&n1,&n2)==2)
        {
res=0; find_heap(1,n1); id1=res;
res=0; find_heap(1,n2); id2=res;
if(id1*2==id2||id1*2+1==id2) f=1;
        }
elseif(sscanf(s.c_str(),"%d is a child of %d",&n1,&n2)==2)
        {
res=0; find_heap(1,n1); id1=res;
res=0; find_heap(1,n2); id2=res;
if(id2*2==id1||id2*2+1==id1) f=1;
        }
elseif(sscanf(s.c_str(),"%d is the root",&n1)==1)
        {
if(n1==rt) f=1;
        }
puts(f?"T":"F");
    }
return0;
}