forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1094Matrix Chain Multiplication.cpp
More file actions
76 lines (68 loc) · 1.47 KB
/
1094Matrix Chain Multiplication.cpp
File metadata and controls
76 lines (68 loc) · 1.47 KB
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
#include <iostream>
#include <string>
using namespace std;
class matrix{
public:
int a;
int b;
static int t;
static int num;
matrix(){}
matrix(int i,int j){
a=i;
b=j;
}
~matrix(){}
matrix operator * (matrix m){
if(b!=m.a) t=1;
num+=a*b*m.b;
return matrix(a,m.b);
}
};
int matrix::t=0;
int matrix::num=0;
int num,t;
matrix mat[26];
matrix mul(char chain[1000000],int m,int n){
if(m==n) return mat[chain[m]-'A'];
int sum=0,i;
if(chain[m]=='('){
for(i=m+1;;i++){
if(chain[i]=='(') sum++;
else if(chain[i]==')'){
if(sum==0) break;
else sum--;
}
}
if(chain[i+1]=='(') return mul(chain,m+1,i-1)*mul(chain,i+2,n-1);
else return mul(chain,m+1,i-1)*mul(chain,n,n);
}
else{
if(chain[m+1]=='(') return mul(chain,m,m)*mul(chain,m+2,n-1);
else return mul(chain,m,m)*mul(chain,n,n);
}
}
int main(void){
int n,i,len;
char ch;
char chain[100000];
cin>>n;
for(i=0;i<n;i++){
cin>>ch;
cin>>mat[ch-'A'].a;
cin>>mat[ch-'A'].b;
}
while(cin>>chain){
len=strlen(chain);
if(len==1){
cout<<"0"<<endl;
continue;
}
matrix::num=0;
matrix::t=0;
mul(chain,1,len-2);
if(matrix::t==1) cout<<"error"<<endl;
else cout<<matrix::num<<endl;
}
return 0;
}