NOIP 2017 时间复杂度 (模拟)

题目大意：略

傻了吧唧的我wa了好几次

我的模拟功底真的不咋地

linux下用gets会报错，我用的fgets

 #include <string>
 #include "stdio.h"
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 #define ll long long
 #define N 1010
 #define rint register int
 #define ll long long
 #define il inline
 #define idx(x) (x-'a'+1)
 #define idg(x) (x-'0')
 using namespace std;
 //re
 int T,n,cnt,j;
 int use[];
 char str[][];
 inline bool isdig(char c)
 {return (''<=c&&c<='')?:;}
 int dfs()
 {
     int ans=,now=j,val=,cal=;
     if(str[j][]=='E') return -;
     if(str[j][]=='F')
     {
         if(use[idx(str[j][])])
             return -;
         use[idx(str[j][])]=;
         while(str[j+][]=='F')
         {
             j++,cal=dfs();
             if(cal==-) return -;
             ans=max(ans,cal);
         }
         int k=;
         while(isdig(str[now][k]))
             val=val*+idg(str[now][k]),k++;
         k++;
         if(str[now][]=='n'){
             if(str[now][]!='n') ans=;
         }else if(!isdig(str[now][k])){
             ans++;
         }else{
             int w=;
             while(isdig(str[now][k]))
                 w=w*+idg(str[now][k]),k++;
             if(val>w) ans=;
         }
     }
     use[idx(str[now][])]=;
     j++;
     if(str[j][]!='E') return -;
     else return ans;
 }

 int main()
 {
     //freopen("complexity6.in","r",stdin);
     scanf("%d",&T);
     for(int t=;t<=T;t++)
     {
         int q=;
         scanf("%d",&n);
         memset(str,,sizeof(str));
         memset(use,,sizeof(use));
         scanf("%s\n",str[]);
         for(int i=;i<=n;i++)
             fgets(str[i],,stdin);
         int ret=,ans=;j=;
         for(;j<=n;j++){
             ans=dfs();
             if(ans==-){ret=-;printf("ERR\n");break;}
             else {ret=max(ret,ans);}
         }
         if(ret==-) continue;
         int k=,flag=;
         while(){
             if(str[][k]=='n') flag=;
             if(!isdig(str[][k]))
                 {k++;continue;}
             while(isdig(str[][k]))
                 q=q*+idg(str[][k]),k++;
             break;
         }
         if(flag==) q=;
         if(ret==q) printf("Yes\n");
         else printf("No\n");
     }
     return ;
 }