CodingPractice/399.c at main · kimhedol00/CodingPractice · GitHub

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
#include <stdio.h>
#include <stdlib.h>

#define MAX_ELEMENTS 40
int map_str(char* strs[MAX_ELEMENTS], char *s, int num){
    int ii;
    for (ii = 0; ii < num; ii++){
        if (!strcmp(strs[ii],s))
            return ii + 1;
    }
    return 0;
}


int findDJ (int *rt, double wt[][MAX_ELEMENTS], int x){
    int rx = rt[x];
    if (rx == x){
        return x;
    }
    rt[x] = findDJ(rt, wt, rx);
    if (rt[x] != rx) {
        wt[x][rt[x]] = wt[x][rx] * wt[rx][rt[x]];
        wt[rt[x]][x] = 1 / (wt[x][rt[x]]);
    }
    return (rt[x]);
}

void unionDJ(int *rt, int *rnk, double wt[][MAX_ELEMENTS], double w, int x, int y){
    int rx, ry;
    rx = findDJ(rt, wt, x);
    ry = findDJ(rt, wt, y);
    wt[x][y] = w;
    wt[y][x] = 1 / w;
    if (rx == ry) return;
    wt[rx][ry] = wt[rx][x] * wt[y][ry] *wt[x][y];
    wt[ry][rx] = 1 / (wt[rx][ry]);
    if (rnk[rx] > rnk[ry]){
        rt[ry] = rx;
    }else if (rnk[ry] > rnk[rx]){
        rt[rx] = ry;
    }else{
        rt[ry] = rx;
        rnk[rx] += 1;
    }
    return;
}

double* calcEquation(char *** equations, int equationsSize, int* equationsColSize, double* values, int valuesSize, char *** queries, int queriesSize, int* queriesColSize, int* returnSize){
    int num_strs = 0;
    char *strs[MAX_ELEMENTS];
    int rt[MAX_ELEMENTS];
    char *s;
    int map_id1, map_id2;
    double wt[MAX_ELEMENTS][MAX_ELEMENTS];
    {
        int rnk[MAX_ELEMENTS];
        for (int ii = 0; ii < MAX_ELEMENTS; ii++){
                for (int jj = 0; jj < MAX_ELEMENTS; jj++)
                    wt[ii][jj] = 1.0;
                rt[ii]  = ii;
                rnk[ii] = 1;
        }
        for (int ii = 0; ii < equationsSize; ii++){
            s =  equations[ii][0];
            if (!(map_id1 = map_str(strs, s, num_strs))){
                strs[num_strs] = s;
                map_id1 = num_strs;
                num_strs++;
            }else  map_id1--;
            s =  equations[ii][1];
            if (!(map_id2 = map_str(strs, s, num_strs))){
                strs[num_strs] = s;
                map_id2 = num_strs;
                num_strs++;
            }else map_id2--;

            unionDJ(rt, rnk, wt, values[ii], map_id1, map_id2);
        }
    }

    double *res = (double *) malloc(sizeof(double) * queriesSize);

    for (int ii = 0; ii < queriesSize; ii++){
        s = queries[ii][0];
        if (!(map_id1 = map_str(strs, s, num_strs))){
            res[ii] = -1;
            continue;
        }else map_id1--;
        s = queries[ii][1];
        if (!(map_id2 = map_str(strs, s, num_strs))){
            res[ii] = -1;
            continue;
        }else map_id2--;

        if (map_id1 == map_id2){
            res[ii] = 1;
        }
        else if (wt[map_id1][map_id2] != 1.0)
            res[ii] = wt[map_id1][map_id2];
        else {
            int rx =  findDJ(rt, wt, map_id1);
            int ry = findDJ (rt, wt, map_id2);
            if (rx == ry){
                res[ii] = wt[map_id1][rx] * wt[rx][map_id2];
            } else
                res[ii] = -1.0;
        }
    }
    *returnSize = queriesSize;
    return res;
}