uva 442 - Matrix Chain Multiplication

Matrix Chain Multiplication

Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.

For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C).

The first one takes 15000 elementary multiplications, but the second one only 3500.

Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.

Input Specification

Input consists of two parts: a list of matrices and a list of expressions.

The first line of the input file contains one integer n (  ), representing the number of matrices in the first part. The next n lines each contain one capital letter, specifying the name of the matrix, and two integers, specifying the number of rows and columns of the matrix.

The second part of the input file strictly adheres to the following syntax (given in EBNF):

SecondPart = Line { Line } <EOF>
Line       = Expression <CR>
Expression = Matrix | "(" Expression Expression ")"
Matrix     = "A" | "B" | "C" | ... | "X" | "Y" | "Z"

Output Specification

For each expression found in the second part of the input file, print one line containing the word "error" if evaluation of the expression leads to an error due to non-matching matrices. Otherwise print one line containing the number of elementary multiplications needed to evaluate the expression in the way specified by the parentheses.

Sample Input

9
A 50 10
B 10 20
C 20 5
D 30 35
E 35 15
F 15 5
G 5 10
H 10 20
I 20 25
A
B
C
(AA)
(AB)
(AC)
(A(BC))
((AB)C)
(((((DE)F)G)H)I)
(D(E(F(G(HI)))))
((D(EF))((GH)I))

Sample Output

0
0
0
error
10000
error
3500
15000
40500
47500
15125

注释：

代码严格按照题目（1.每个括号内只有两个元素。2.括号是正确匹配的）写的，不具有generality。

步骤：

while(此行还有元素)

{

          读取下一个元素;

                  若为'(' 入栈;

                  若为capital, 入栈。

                  若为')',出栈2个元素，记为左右操作数

                          若左操作数的列不等与右操作数的行数,print  error，退出

                           计算左右操作数乘积数,加到总乘积数

                          出栈（把左括号出栈）

                          入栈乘积的结果矩阵

           返回从乘积数

}   

 
 

  
  
#include 
    
    
     
     
typedef struct mat mat;
struct mat{
    int r;
    int c;
};
mat m[500];
int cnt;
int num_of_mul(char s[], int row[], int col[])
{
    int i, top, num;
    int left, right;
    int stack[500];
    top = num = 0;
    for(i = 0; s[i] != '\0'; i++){
        if(s[i] == ')'){
            right = stack[--top];
            left = stack[--top];
            if(m[left].c != m[right].r)
                return -1;
            num += m[left].r * m[left].c * m[right].c;
            m[cnt].r = m[left].r;
            m[cnt].c = m[right].c;
            top--;
            stack[top++] = cnt;
            cnt++;
        }
        else if(s[i] == '('){
            stack[top++] = s[i];
        }
        else{
            m[cnt].r = row[s[i]-'A'];
            m[cnt].c = col[s[i]-'A'];
            stack[top++] = cnt;
            cnt++;
        }
    }
    return num;
}
        
int main()
{
    char s[100];
    int n, r, c, num;
    int row[26], col[26];
    cnt = 0;
    scanf("%d", &n);
    while(n-- > 0){
        scanf("%s %d %d", s, &r, &c);
        row[s[0]-'A'] = r;
        col[s[0]-'A'] = c;
    }
    while(scanf("%s", s) != EOF){
        num = num_of_mul(s, row, col);
        if(num < 0)
            printf("error\n");
        else
            printf("%d\n", num);
    }
    return 0;
}