zoj 1094

#include<iostream>
using namespace std;
struct node{
    int row,col,v;
    char c;
}stack[100000];
int top;
int num[200][2];
int n,i;
char mg[1000];
void push(char c,int row,int col){
     top++;
     stack[top].row=row;
     stack[top].col=col;
     stack[top].c=c;   
     stack[top].v=0;
}
void cal(int rowh,int colh,int vh){
      int row=stack[top].row;
      int col=colh;
      int v=stack[top].v+row*col*stack[top].col+vh;
      top=top-2;
      i++;
      if(top<0 || stack[top].c=='('){
          top++;
          stack[top].row=row;
          stack[top].col=col;
          stack[top].v=v;
          stack[top].c='[';//代表复合eg：AB*/
          return;  
      }
      cal(row,col,v);
}
int main()
{
     char c;
     bool sign=1;
     scanf("%d",&n);
     for(i=0;i<n;i++){
         scanf("%c",&c);
         while(c==' ' || c=='/n') scanf("%c",&c);
         scanf("%d %d",&num[c][0],&num[c][1]);
     }
     while(scanf("%s",mg)!=EOF){
         if(strlen(mg)==1) printf("0/n");
         else{
              i=0,top=-1;
              while(mg[i]!='/0'){
                   if(mg[i]=='(') push('(',0,0);
                  // else if(mg[i]==')') top--;
                   else if(stack[top].c=='(') push(mg[i],num[mg[i]][0],num[mg[i]][1]);
                   else{
                       if(stack[top].col!=num[mg[i]][0]){
                             printf("error/n");
                             sign=0;
                             break;
                       }
                       cal(num[mg[i]][0],num[mg[i]][1],0);                                                         
                   }
                   i++;                 
              }
              if(sign) printf("%d/n",stack[top].v);
              sign=1;    
         }                          
     }
     system("pause");
     return 0;
}