堆的操作——push/pop
阿新 • • 發佈:2019-02-13
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
#define PI 3.1415926535897932
#define E 2.718281828459045
#define INF 0x3f3f3f3f
#define mod 123456789
#define N 70
typedef long long ll;
const int M=1005;
int n,m;
int cnt;
int sx,sy,sz;
int mp[M][12];
int pa[M*10],rankk[M];
int head[M*6],vis[M*10];
double dis[M][10];
ll prime[M*1000];
bool isprime[M*1000];
int lowcost[M],closet[M];
char st1[5050],st2[5050];
int len[M*6];
typedef pair<int ,int> ac;
vector<int> g[M*10];
int dp[2005][2005];
int has[105][105];
int month[13]= {0,31,59,90,120,151,181,212,243,273,304,334,0};
int dir[8][2]= {{0,1},{0,-1},{-1,0},{1,0},{1,1},{1,-1},{-1,1},{-1,-1}};
bool isrun(int year)
{
if((year%4==0&&year%100!=0)||(year%400==0))
return true;
return false;
}
void getpri()
{
ll i;
int j;
cnt=0;
memset(isprime,false,sizeof(isprime));
for(i=2; i<1000000LL; i++)
{
if(!isprime[i])prime[cnt++]=i;
for(j=0; j<cnt&&prime[j]*i<1000000LL; j++)
{
isprime[i*prime[j]]=1;
if(i%prime[j]==0)break;
}
}
}
ll qk_mul(ll a,ll b,ll mo)
{
ll t=0;
while(b)
{
if(b&1)
t=(t+a)%mo;
a=(a<<1)%mo;
b>>=1;
}
t%=mo;
return t;
}
ll qk_mod(ll a,ll b,ll mo)
{
ll ans=1;
while(b)
{
if(b&1) ans=qk_mul(ans,a,mo);
a=qk_mul(a,a,mo);
b>>=1;
}
ans%=mo;
return ans;
}
int gcd(int a,int b)
{
return b == 0 ? a : gcd(b, a%b);
}
int findx(int t)
{
if(t!=pa[t])
pa[t]=findx(pa[t]);
return pa[t];
}
void unionx(int x,int y)
{
x=findx(x);
y=findx(y);
if(x!=y)
{
pa[y]=x;
}
}
int in[50],post[50];
struct node
{
int data;
node *left,*right;
}*roo;
node *create(int *pre,int *in,int len)
{
int i;
if(len<=0)return NULL;
node *root=(node *)malloc(sizeof(node));
root->data=*pre;
++cnt;
if(cnt==1)roo=root;
for(i=0; i<len; i++)
if(in[i]==*pre)break;
root->left=create(pre+1,in,i);
root->right=create(pre+1+i,in+i+1,len-i-1);
return root;
}
node *create2(int *post,int *in,int len)
{
int i;
if(len<=0)return NULL;
node *root=(node *)malloc(sizeof(node));
root->data=*(post+len-1);
++cnt;
if(cnt==1)roo=root;
for(i=0; i<len; i++)
if(in[i]==*(post+len-1))break;
//k=p-in;!!!in+i==p!!!k==i
root->left=create2(post,in,i);
root->right=create2(post+i,in+i+1,len-i-1);
//root->right=create(post+i,p+1,len-k-1);
return root;
}
void init()
{
for(int i=0; i<101; i++)
pa[i]=i;
}
int heap[100005];
void push(int x)
{
int i=++sz;
while(i>1){ //i>0
int p=i/2; //(i-1)/2
if(heap[p]<=x)break;
heap[i]=heap[p];
i=p;
}
heap[i]=x;
/* a[++sz] = x;
int t = a[sz];
int tson = sz;
while( (tson > 1)&&( a[tson/2] > t))
{
a[tson] = a[tson/2];
tson = tson/2;
}
a[tson] = x;
*/
}
int pop()
{
int ret=heap[1];//int ret=a[0]
int x=heap[sz--];//a[--sz]
int i=1;// i=0
while(2*i<sz) //2*i+1
{
int a=i*2,b=i*2+1;
if(b<sz&&heap[b]<heap[a])a=b;
if(heap[a]>=x)break;
heap[i]=heap[a];
i=a;
}
heap[i]=x;
return ret;
}
int main()
{
int i,j,t,k;
int u,v,rela;
// init();
int x, y;;
map <int, int> index; //記錄下標
string s;
cin >> n >> m;
//n=0;
//建樹
for(i=0; i<n; i++)
{
cin >> x;
push(x);
}
pop();
for(i=1;i<=sz;i++)
printf("%d ",heap[i]);
//給map賦值
for(i=1; i<=sz; i++)
{
index[heap[i]] = i;
}
for(i=0; i<m; i++)
{
cin >> x;
cin >> s;
int index_x = index[x];
int index_y;
if(s[0] == 'a')
{
cin >> y;
getline(cin, s); //這個函式可以輸入一個帶空格的字串
index_y = index[y];
if(index_x/2 == index_y/2)
puts("T");
else
puts("F");
}
else
{
cin >> s;
cin >> s;
if(s[0] == 'r')
{
if(index_x == 1)
puts("T");
else
puts("F");
}
else if(s[0] == 'p')
{
cin >> s;
cin >> y;
index_y = index[y];
if(index_y/2 == index_x)
puts("T");
else
puts("F");
}
else
{
cin >> s;
cin >> y;
index_y = index[y];
if(index_x/2 == index_y)
puts("T");
else
puts("F");
}
}
}
return 0;
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
#define PI 3.1415926535897932
#define E 2.718281828459045
#define INF 0x3f3f3f3f
#define mod 123456789
#define N 70
typedef long long ll;
const int M=1005;
int n,m;
int cnt;
int sx,sy,sz;
int mp[M][12];
int pa[M*10],rankk[M];
int head[M*6],vis[M*10];
double dis[M][10];
ll prime[M*1000];
bool isprime[M*1000];
int lowcost[M],closet[M];
char st1[5050],st2[5050];
int len[M*6];
typedef pair<int ,int> ac;
vector<int> g[M*10];
int dp[2005][2005];
int has[105][105];
int month[13]= {0,31,59,90,120,151,181,212,243,273,304,334,0};
int dir[8][2]= {{0,1},{0,-1},{-1,0},{1,0},{1,1},{1,-1},{-1,1},{-1,-1}};
bool isrun(int year)
{
if((year%4==0&&year%100!=0)||(year%400==0))
return true;
return false;
}
void getpri()
{
ll i;
int j;
cnt=0;
memset(isprime,false,sizeof(isprime));
for(i=2; i<1000000LL; i++)
{
if(!isprime[i])prime[cnt++]=i;
for(j=0; j<cnt&&prime[j]*i<1000000LL; j++)
{
isprime[i*prime[j]]=1;
if(i%prime[j]==0)break;
}
}
}
ll qk_mul(ll a,ll b,ll mo)
{
ll t=0;
while(b)
{
if(b&1)
t=(t+a)%mo;
a=(a<<1)%mo;
b>>=1;
}
t%=mo;
return t;
}
ll qk_mod(ll a,ll b,ll mo)
{
ll ans=1;
while(b)
{
if(b&1) ans=qk_mul(ans,a,mo);
a=qk_mul(a,a,mo);
b>>=1;
}
ans%=mo;
return ans;
}
int gcd(int a,int b)
{
return b == 0 ? a : gcd(b, a%b);
}
int findx(int t)
{
if(t!=pa[t])
pa[t]=findx(pa[t]);
return pa[t];
}
void unionx(int x,int y)
{
x=findx(x);
y=findx(y);
if(x!=y)
{
pa[y]=x;
}
}
int in[50],post[50];
struct node
{
int data;
node *left,*right;
}*roo;
node *create(int *pre,int *in,int len)
{
int i;
if(len<=0)return NULL;
node *root=(node *)malloc(sizeof(node));
root->data=*pre;
++cnt;
if(cnt==1)roo=root;
for(i=0; i<len; i++)
if(in[i]==*pre)break;
root->left=create(pre+1,in,i);
root->right=create(pre+1+i,in+i+1,len-i-1);
return root;
}
node *create2(int *post,int *in,int len)
{
int i;
if(len<=0)return NULL;
node *root=(node *)malloc(sizeof(node));
root->data=*(post+len-1);
++cnt;
if(cnt==1)roo=root;
for(i=0; i<len; i++)
if(in[i]==*(post+len-1))break;
//k=p-in;!!!in+i==p!!!k==i
root->left=create2(post,in,i);
root->right=create2(post+i,in+i+1,len-i-1);
//root->right=create(post+i,p+1,len-k-1);
return root;
}
void init()
{
for(int i=0; i<101; i++)
pa[i]=i;
}
int heap[100005];
void push(int x)
{
int i=++sz;
while(i>1){ //i>0
int p=i/2; //(i-1)/2
if(heap[p]<=x)break;
heap[i]=heap[p];
i=p;
}
heap[i]=x;
/* a[++sz] = x;
int t = a[sz];
int tson = sz;
while( (tson > 1)&&( a[tson/2] > t))
{
a[tson] = a[tson/2];
tson = tson/2;
}
a[tson] = x;
*/
}
int pop()
{
int ret=heap[1];//int ret=a[0]
int x=heap[sz--];//a[--sz]
int i=1;// i=0
while(2*i<sz) //2*i+1
{
int a=i*2,b=i*2+1;
if(b<sz&&heap[b]<heap[a])a=b;
if(heap[a]>=x)break;
heap[i]=heap[a];
i=a;
}
heap[i]=x;
return ret;
}
int main()
{
int i,j,t,k;
int u,v,rela;
// init();
int x, y;;
map <int, int> index; //記錄下標
string s;
cin >> n >> m;
//n=0;
//建樹
for(i=0; i<n; i++)
{
cin >> x;
push(x);
}
pop();
for(i=1;i<=sz;i++)
printf("%d ",heap[i]);
//給map賦值
for(i=1; i<=sz; i++)
{
index[heap[i]] = i;
}
for(i=0; i<m; i++)
{
cin >> x;
cin >> s;
int index_x = index[x];
int index_y;
if(s[0] == 'a')
{
cin >> y;
getline(cin, s); //這個函式可以輸入一個帶空格的字串
index_y = index[y];
if(index_x/2 == index_y/2)
puts("T");
else
puts("F");
}
else
{
cin >> s;
cin >> s;
if(s[0] == 'r')
{
if(index_x == 1)
puts("T");
else
puts("F");
}
else if(s[0] == 'p')
{
cin >> s;
cin >> y;
index_y = index[y];
if(index_y/2 == index_x)
puts("T");
else
puts("F");
}
else
{
cin >> s;
cin >> y;
index_y = index[y];
if(index_x/2 == index_y)
puts("T");
else
puts("F");
}
}
}
return 0;
}
將一系列給定數字順序插入一個初始為空的小頂堆H[]
。隨後判斷一系列相關命題是否為真。命題分下列幾種:
x is the root
:x
是根結點;x and y are siblings
:x
和y
是兄弟結點;x is the parent of y
:x
是y
的父結點;x is a child of y
:x
是y
的一個子結點。