fork download
copy 
  1. // heap-ki
  2.  
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5.  
  6. #define height 4
  7. #define MAX (1<<height)  //ビットシフト演算 2^height と同じ
  8.  
  9. int t[MAX+1]; //配列外アクセス防止のためのダミーで＋１
  10. int sz = 0;
  11.  
  12. void swap(int *x, int *y){
  13.     int tmp = *x;
  14.     *x = *y;
  15.     *y = tmp;
  16. }
  17.  
  18. void initTree(int n){
  19.     int i;
  20.     for(i=0;i<MAX;i++){
  21.         t[i] = -1;
  22.     }
  23. }
  24.  
  25. void printA(){
  26.     int i;
  27.     for(i=1;i<=sz;i++) printf("%d ",t[i]);
  28.     printf("\n");
  29. }
  30.  
  31. void printT(int i){
  32.     int x = i;
  33.     while(x/2!=0){
  34.         printf("  ");
  35.         x/=2;
  36.     }
  37.     printf("%d\n",t[i]);
  38. }
  39.  
  40. int goP(int i){
  41.     if(i/2 == 0) return 0;
  42.     else return i/2;
  43. }
  44.  
  45. int goL(int i){
  46.     if(2*i >= MAX) return 0;
  47.     else return 2*i;
  48. }
  49.  
  50. int goR(int i){
  51.     if(2*i+1 >= MAX) return 0;
  52.     else return 2*i+1;
  53. }
  54.  
  55. void preOrder(int i){
  56.     if(t[i] == -1) return;
  57.     printT(i);
  58.     preOrder(goL(i));
  59.     preOrder(goR(i));
  60. }
  61.  
  62. void inOrder(int i){
  63.     if(t[i] == -1) return;
  64.     inOrder(goL(i));
  65.     printT(i);
  66.     inOrder(goR(i));
  67. }
  68.  
  69. void postOrder(int i){
  70.     if(t[i] == -1) return;
  71.     postOrder(goL(i));
  72.     postOrder(goR(i));
  73.     printT(i);
  74. }
  75.  
  76. void insBT(int x){
  77.     int k,i = 1;
  78.     for(k=0;k<height;k++){
  79.         if(t[i]==-1){
  80.             t[i] = x;
  81.             sz++;
  82.             return;
  83.         }
  84.         if(x < t[i]) i = goL(i);
  85.         else i = goR(i);
  86.     }
  87.     printf("Error : too high -> %d\n",x);
  88. }
  89.  
  90.  
  91. int popHeap(){
  92.     if(sz == 0) return -1; 
  93.     int root = t[1]; 
  94.     t[1] = t[sz]; 
  95.     t[sz] = -1; 
  96.     sz--; 
  97.     int i = 1;
  98.     while(goL(i) <= sz){ 
  99.         int largerChild = goL(i);
  100.         if(goR(i) <= sz && t[goR(i)] > t[goL(i)]) largerChild = goR(i); 
  101.  
  102.         if(t[i] >= t[largerChild]) break; 
  103.  
  104.         swap(&t[i], &t[largerChild]); 
  105.         i = largerChild; 
  106.     }
  107.     return root;
  108. }
  109.  
  110.  
  111. void pushHeap(int x){
  112.     if(sz >= MAX - 1) return; 
  113.     sz++;
  114.     t[sz] = x; 
  115.  
  116.     int i = sz;
  117.     while(goP(i) != 0 && t[i] > t[goP(i)]){ 
  118.         swap(&t[i], &t[goP(i)]);
  119.         i = goP(i); 
  120.     }
  121. }
  122.  
  123.  
  124. int main(void){
  125.     int i,x,n;
  126.     scanf("%d",&n);
  127.     // 木の初期化
  128.     initTree(n);
  129.     for(i=0;i<n;i++){
  130.         scanf("%d",&t[i+1]);
  131.     }
  132.     sz = n;
  133.     // 中間順で表示
  134. 	inOrder(1);
  135.  
  136. 	// pop
  137. 	int a=popHeap();
  138. 	printf("pop : %d\n",a);
  139. 	inOrder(1);
  140.  
  141. 	a = popHeap();
  142. 	printf("pop : %d\n",a);
  143.  
  144. 	inOrder(1);
  145.  
  146. 	printf("push : 100\n");
  147. 	pushHeap(100);
  148. 	inOrder(1);
  149.  
  150. 	printf("push : 30\n");
  151. 	pushHeap(30);
  152. 	inOrder(1);
  153.     return 0;
  154. }
Success #stdin #stdout 0.01s 5276KB
comments (?)
stdin
copy 
12
89 34 55 13 16 21 32 2 3 4 5 8
stdout
copy 
      2
    13
      3
  34
      4
    16
      5
89
      8
    21
  55
    32
pop : 89
      2
    13
      3
  34
      4
    16
      5
55
    21
  32
    8
pop : 55
      2
    13
      3
  16
      4
    5
34
    21
  32
    8
push : 100
      2
    13
      3
  34
      4
    16
      5
100
    21
  32
    8
push : 30
      2
    13
      3
  34
      4
    16
      5
100
      21
    30
  32
    8
https://ideone.com/FhSCNr
language:
C (gcc 8.3)
created:
7 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!