lab1-handout
哦豁，十字链表，awsl
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 |
#include <stdio.h> #include <stdlib.h> typedef struct OL { int row, col, w; struct OL *right, *down; }OL, *olink; typedef struct { olink *rhead,*chead; int mu, nu, tu; }cross, *cr; void init(cross *M, int m, int n) { M -> mu = m, M -> nu = n; M -> rhead = (olink*)malloc(sizeof(olink) * (m + 1)); M -> chead = (olink*)malloc(sizeof(olink) * (n + 1)); for(int i = 1; i <= m; i++) M -> rhead[i] = NULL; for(int i = 1; i <= n; i++) M -> chead[i] = NULL; } void insert(cross &M, olink &p) { int row = p -> row, col = p -> col; int de = 0, pl = 0; if(M.rhead[row] == NULL) M.rhead[row] = p; else { olink q = M.rhead[row], pre = q; while(q && (q -> col < p -> col)) pre = q, q = q -> right; if(q != NULL && (q -> col == p -> col)){ q -> w += p -> w; if(q -> w == 0){ if(pre == q) M.rhead[row] = q -> right; else pre -> right = q -> right; de = 1; } else pl = 1; } if(de == 0 && pl == 0){ if(pre == q) M.rhead[row] = p, p -> right = q; else pre -> right = p, p -> right = q; } } if(M.chead[col] == NULL) M.chead[col] = p; else { olink q = M.chead[col], pre = q; while(q && (q -> row < p -> row)) pre = q, q = q -> down; if(de == 1){ if(q != NULL){ if(pre == q) M.chead[col] = q -> down; else pre -> down = q -> down; free(q), free(p); return; } } if(pl == 0) { if(pre == q) M.chead[col] = p, p -> down = q; else pre -> down = p, p -> down = q; } } } void creat(cross &M, int t) { int row, col, w; for(int i = 1; i <= t; i++){ scanf("%d%d%d", &row, &col, &w); olink p = (olink)malloc(sizeof(OL)); p -> row = row, p -> col = col, p -> w = w, p -> right = NULL, p -> down = NULL; insert(M, p); } } void add(cross &M, cross &N) { for(int i = 1; i <= N.mu; i++){ olink p = N.rhead[i]; for(int j = 1; j <= N.nu; j++) if(p != NULL && j == p -> col){ olink q = (olink)malloc(sizeof(OL)); q -> down = p -> down; q -> right = p -> right; q -> w = p -> w; q -> row = p -> row; q -> col = p -> col; insert(M, q); p = p -> right; } } } void print(cross &M) { for(int i = 1; i <= M.mu; i++){ olink P = M.rhead[i]; for(int j = 1; j <= M.nu; j++) if(P != NULL && j == P -> col){ printf("%d %d %d\n", P -> row, P -> col, P -> w); P = P -> right; } } } int main() { int m, n, t1, t2; scanf("%d%d%d%d", &m, &n, &t1, &t2); cross a, b; init(&a, m, n), init(&b, m, n); creat(a, t1), creat(b, t2); add(a, b), print(a); return 0; } |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 |
#include <stdio.h> #include <stdlib.h> typedef struct OL { int row, col, w; struct OL *right, *down; }OL, *olink; typedef struct { olink *rhead, *chead; int mu, nu; }cross, *cr; void init(cross *M, int m, int n) { M -> mu = m, M -> nu = n; M -> rhead = (olink*)malloc(sizeof(olink) * (m + 1)); M -> chead = (olink*)malloc(sizeof(olink) * (n + 1)); for(int i = 1; i <= m; i++) M -> rhead[i] = NULL; for(int i = 1; i <= n; i++) M -> chead[i] = NULL; } void insert(cross &M, olink &p){ int row = p -> row, col = p -> col; int de = 0, pl = 0; if(M.rhead[row] == NULL) M.rhead[row] = p; else { olink q = M.rhead[row], pre = q; while(q && (q -> col < p -> col)) pre = q, q = q -> right; if(q != NULL && (q -> col == p -> col)){ q -> w += p -> w; if(q -> w == 0){ if(pre == q) M.rhead[row] = q -> right; else pre -> right = q -> right; de = 1; } else pl = 1; } if(de == 0 && pl == 0){ if(pre == q) M.rhead[row] = p, p -> right = q; else pre -> right = p, p -> right = q; } } if(M.chead[col] == NULL) M.chead[col] = p; else { olink q = M.chead[col], pre = q; while(q && (q -> row < p -> row)) pre = q, q = q -> down; if(de == 1){ if(q != NULL){ if(pre == q) M.chead[col] = q -> down; else pre -> down = q -> down; free(q), free(p); return; } } if(pl == 0) { if(pre == q) M.chead[col] = p, p -> down = q; else pre -> down = p, p -> down = q; } } } void creat(cross &M) { int row, col, w; while(scanf("%d %d %d", &row, &col, &w)){ if(!row && !col && !w) break; olink p = (olink)malloc(sizeof(OL)), q; p -> row = row, p -> col = col, p -> w = w, p -> right = NULL, p -> down = NULL; insert(M, p); } } void mul(cross &M, cross &N, cross &ANS) { for(int i = 1; i <= M.mu; i++){ olink p = M.rhead[i]; for(int j = 1; j <= M.nu; j++) if(p != NULL && j == p -> col){ for(int ii = 1; ii <= N.mu; ii++){ olink q = N.rhead[ii]; for(int jj = 1; jj <= N.nu; jj++) if(q != NULL && jj == q -> col){ if(q -> row != p -> col) continue; olink pro = (olink)malloc(sizeof(OL)); pro -> down = NULL, pro -> right = NULL; pro -> w = p -> w * q -> w; pro -> row = p -> row; pro -> col = q -> col; insert(ANS, pro); q = q -> right; } } p = p -> right; } } } void print(cross &M) { for(int i = 1; i <= M.mu; i++){ olink p = M.rhead[i]; for(int j = 1; j <= M.nu; j++) if(p != NULL && j == p -> col){ printf("%d %d %d\n", p -> row, p -> col, p -> w); p = p -> right; } } } int main() { int m, n, t1, t2, mm, nn; cross a, b, c; scanf("%d %d", &m, &n), init(&a, m, n), creat(a), mm = m; scanf("%d %d", &m, &n), init(&b, m, n), creat(b), nn = n; init(&c, mm, nn); mul(a, b, c), print(c); return 0; } |