2011-07-09 07:12:54Morris
a175. 撒旦玩不玩骰子？ (SplayTree 版本)
a175. 撒旦玩不玩骰子？
內容 ：
雜湊表（Hash table，也叫哈希表），是根據關鍵碼值(Key value)而直接進行查詢的資料結構。也就是說，它通過把關鍵碼值映射到表中一個位置來查詢記錄，以加快查找的速度。這個映射函數叫做雜湊函數，存放記錄的數組叫做雜湊表。
以上資料引用自維基百科
現在想請你模擬出一個簡單的 Hash Table
把所有數字經由 mod m 分成 m 個區間
每次給你一個數字 N
有三個操作依下列所示
操作 1: 將數字 N mod m 存入 Hash Table
操作 2: 將數字 N 從 Hash Table 中釋放（刪除）
操作 3: 將整個 Hash Table 輸出
輸入說明 ：
有多筆測資，每組第一行有兩個數字 k, m (1 ≦ k ≦ 10,0000, 1 ≦ m ≦ 200)
分別代表接下來有 k 筆操作, 模數 m
接下來的每一行
若第一個數字為 1， 則接下來會一個數字 N，將這個數字插入 Hash Table
若第一個數字為 2， 則接下來會一個數字 N，將這個數字從 Hash Table 刪除
若第一個數字為 3， 則輸出整個 Hash Table
0 ≦ N < 231-1
輸出說明 ：
若有兩個以上的數字在同一個區間內
輸出時請由小到大輸出
其餘輸出格式請參照範例輸出
輸出時請由小到大輸出
其餘輸出格式請參照範例輸出
範例輸入 ：
13 51 171 8331 181 2431 371 641 8432 183
範例輸出 ：
===== s =====[000]:NULL[001]:NULL[002]:17 -> NULL[003]:8 -> NULL[004]:NULL===== e ========== s =====[000]:NULL[001]:NULL[002]:17 -> NULL[003]:8 -> NULL[004]:NULL===== e ========== s =====[000]:NULL[001]:NULL[002]:17 -> NULL[003]:8 -> 18 -> NULL[004]:24 -> NULL===== e ========== s =====[000]:NULL[001]:NULL[002]:17 -> 37 -> NULL[003]:8 -> 18 -> NULL[004]:24 -> 64 -> 84 -> NULL===== e ========== s =====[000]:NULL[001]:NULL[002]:17 -> 37 -> NULL[003]:8 -> NULL[004]:24 -> 64 -> 84 -> NULL===== e =====
提示 ：
背景知識： Hash Table
× 若在存入時，發現數字重複，則不予理會
× 若在刪除時，發現數字不存在，則不予理會
× 循序不可
× 此題與 a174: 上帝玩不玩骰子 略有不同
題目由 example 編輯
出處 ：
Hash Table (管理：morris1028)
作法 : SplayTree
這真的是編程複雜度最低的平衡樹嗎 ?
以下程式碼就 200 行了 ...
建 m 棵 SplayTree，來做插入跟刪除的動作
/**********************************************************************************/
/* Problem: a175 "撒旦玩不玩骰子？" from Hash Table */
/* Language: C */
/* Result: AC (240ms, 816KB) on ZeroJudge */
/* Author: morris1028 at 2011-07-09 17:15:37 */
/**********************************************************************************/
#include<stdio.h>
#include<stdlib.h>
#define IsLc(X) ((X) == (X)->p->lc)
#define IsRc(X) ((X) == (X)->p->rc)
typedef struct SpNode {
int v;
struct SpNode *p, *lc, *rc;
}SpNode;
typedef struct SpTree{
struct SpNode *NIL, *root;
}SpTree;
SpNode *SpMax(SpTree*, SpNode*);
SpNode *SpMin(SpTree*, SpNode*);
SpNode *SpFind(SpTree*, int);
void Spinit(SpTree*);
void SpFree(SpTree*, SpNode*);
void SpPrint(SpTree*, SpNode*);
void SpZig(SpTree*, SpNode*);
void SpZag(SpTree*, SpNode*);
void SpSplay(SpTree*, SpNode*, SpNode*);
void InsSp(SpTree*, int);
void DelSp(SpTree*, int);
void Spinit(SpTree *tree) {
tree->NIL = (SpNode*)malloc(sizeof(SpNode));
tree->root = tree->NIL->p = tree->NIL;
}
void SpFree(SpTree *tree, SpNode *now) {
if(now == tree->NIL) return;
if(now->lc != tree->NIL) SpFree(tree, now->lc);
if(now->rc != tree->NIL) SpFree(tree, now->rc);
free(now);
}
void SpPrint(SpTree *tree, SpNode *now) {
if(now == tree->NIL) return;
if(now->lc != tree->NIL) SpPrint(tree, now->lc);
printf("%d -> ", now->v);
if(now->rc != tree->NIL) SpPrint(tree, now->rc);
}
SpNode *SpMax(SpTree *tree, SpNode *node) {/*Max node*/
if(node == tree->NIL || node->rc == tree->NIL) return node;
return SpMax(tree, node->rc);
}
SpNode *SpMin(SpTree *tree, SpNode *node) {/*Min node*/
if(node == tree->NIL || node->lc == tree->NIL) return node;
return SpMin(tree, node->lc);
}
void SpZig(SpTree *tree, SpNode *node) {
/*<right-rotate>*/
SpNode *lc = node->lc;
lc->p = node->p;
if(node == tree->root) tree->root = lc;
else if(IsLc(node)) node->p->lc = lc;
else node->p->rc = lc;
node->p = lc;
node->lc = lc->rc;
lc->rc->p = node;
lc->rc = node;
}
void SpZag(SpTree *tree, SpNode *node) {
/*<left-rotate>*/
SpNode *rc = node->rc;
rc->p = node->p;
if(node == tree->root) tree->root = rc;
else if(IsLc(node)) node->p->lc = rc;
else node->p->rc = rc;
node->p = rc;
node->rc = rc->lc;
rc->lc->p = node;
rc->lc = node;
}
void SpSplay(SpTree *tree, SpNode *node, SpNode *dest) {
if(node == dest) return;
while(node->p != dest) {
if(node->p->p == dest) {
if(IsLc(node))/*Zig*/
SpZig(tree, node->p);
else/*Zag*/
SpZag(tree, node->p);
}
else if(IsLc(node)) {
if(IsLc(node->p)) {/*Zig-Zig*/
SpZig(tree, node->p->p);
SpZig(tree, node->p);
}
else {/*Zig-Zag*/
SpZig(tree, node->p);
SpZag(tree, node->p);
}
}
else {
if(IsRc(node->p)) {
SpZag(tree, node->p->p);
SpZag(tree, node->p);
}
else {
SpZag(tree, node->p);
SpZig(tree, node->p);
}
}
}
}
void InsSp(SpTree *tree, int key) {
SpNode *curr = tree->root, *prev = tree->NIL;
while(curr != tree->NIL) {
prev = curr;
if(curr->v > key) curr = curr->lc;
else if(curr->v < key) curr = curr->rc;
else return;
}
curr = (SpNode*)malloc(sizeof(SpNode));
curr->v = key;
curr->p = prev;
curr->lc = curr->rc = tree->NIL;
if(prev == tree->NIL) tree->root = curr;
else if(prev->v > key) prev->lc = curr;
else prev->rc = curr;
SpSplay(tree, curr, tree->NIL);
}
void DelSp(SpTree *tree, int key) {
SpNode *node = SpFind(tree, key);
if(node == tree->NIL) return;
SpSplay(tree, node, tree->NIL);
if(node->lc == tree->NIL && node->rc == tree->NIL)
free(node), tree->root = tree->NIL;
else {
SpNode *temp = SpMin(tree, node->rc);
if(temp == tree->NIL) {
tree->root = node->lc;
node->lc->p = tree->NIL;
}
else {
if(temp != node->rc) {
temp->rc->p = temp->p;
temp->p->lc = temp->rc;
temp->rc = node->rc;
}
temp->lc = node->lc;
node->lc->p = temp, node->rc->p = temp;
temp->p = tree->NIL, tree->root = temp;
}
free(node);
}
}
SpNode *SpFind(SpTree *tree, int key) {
SpNode *curr = tree->root;
while(curr != tree->NIL) {
if(curr->v > key) curr = curr->lc;
else if(curr->v < key) curr = curr->rc;
else return curr;
}
return tree->NIL;
}
main() {
int a, k, n, op, Mod;
while(scanf("%d %d", &k, &Mod) == 2) {
SpTree Tree[Mod];
for(a = 0; a < Mod; a++) Spinit(&Tree[a]);
while(k--) {
scanf("%d", &op);
switch(op) {
case 1:scanf("%d", &n);
InsSp(&Tree[n%Mod], n);break;
case 2:scanf("%d", &n);
DelSp(&Tree[n%Mod], n);break;
case 3:{
puts("===== s =====");
for(a = 0; a < Mod; a++) {
printf("[%03d]:", a); SpPrint(&Tree[a], Tree[a].root);
puts("NULL");
}
puts("===== e =====");
break;
}
}
}
for(a = 0; a < Mod; a++) SpFree(&Tree[a], Tree[a].root);
}
return 0;
}