【比赛】NOIP2017 时间复杂度

恶心的模拟题，考场上犯了一堆错误，多组数据清空没清完、数组开小。。。民间都是50分，结果CCF90。。

考完后随便改改就过了，还好只少了10分，如果真的是50，我估计会疯掉。

因为考场的时候没写好，所以最终的代码也很难看。

 #include<bits/stdc++.h>
 using namespace std;
 int T,n,stk[],p[],fnum,stack_num,sck[],sck_num;
 char s[],ch[],res[];
 inline void init()
 {
     memset(p,,sizeof(p));
     memset(res,,sizeof(res));
     memset(sck,,sizeof(sck));
     memset(stk,,sizeof(stk));
     sck_num=;
     stack_num=;
     fnum=;
 }
 inline void Dealwith()
 {
     init();
     int ans=,mark=,nxt=,nnum=,las=,done=;
     for(register int i=;i<=n;++i)
     {
         scanf("%s",ch);
         if(ch[]=='F')
         {
             if(done)
             {
                 scanf("%s",ch);
                 scanf("%s",ch);
                 scanf("%s",ch);
                 continue;
             }
             fnum++;
             scanf("%s",ch);
             if(p[ch[]-'a'])
             {
                 printf("ERR\n");
                 done=;
             }
             p[ch[]-'a']=;
             stk[++stack_num]=ch[]-'a';
             int fl1,num1=,fl2,num2=;

             scanf("%s",ch);
             if(ch[]>=''&&ch[]<='')
             {
                 fl1=;
                 for(register int j=;j<strlen(ch);++j)num1=(num1<<)+(num1<<)+(ch[j]^'');
             }
             else fl1=;

             scanf("%s",ch);
             if(ch[]>=''&&ch[]<='')
             {
                 fl2=;
                 for(register int j=;j<strlen(ch);++j)num2=(num2<<)+(num2<<)+(ch[j]^'');
             }
             else fl2=;

             if(fnum!=nxt)continue;

             if(fl1==&&fl2==)nxt=fnum;
             else if(fl1==&&fl2==)
             {
                 if(num1>num2)nxt=fnum;
                 else nxt=fnum+,sck[++sck_num]=;
             }
             else if(fl1==&&fl2==)
             {
                 mark=;
                 nnum++;
                 if(ans<nnum)ans++;
                 nxt=fnum+;
                 sck[++sck_num]=;
             }
             else sck[++sck_num]=,nxt=fnum+;
         }
         else
         {
             if(done)continue;
             if(!fnum)
             {
                 printf("ERR\n");
                 done=;
             }
             if(done)continue;
             if(nxt==fnum+)
             {
                 fnum--,nxt--;
                 if(sck[sck_num--]==)nnum--;
             }
             else fnum--;
             p[stk[stack_num--]]=;
         }
     }
     if(done)return ;
     if(fnum)
     {
         printf("ERR\n");
         return ;
     }
     if(mark)
     {
         res[]='O',res[]='(',res[]='n',res[]='^';
         int respos=,tmppos=;
         char tmp[];
         while(ans)tmp[++tmppos]=ans%+'',ans/=;
         while(tmppos)res[++respos]=tmp[tmppos--];
         res[++respos]=')';res[++respos]='\0';
     }
     else res[]='O',res[]='(',res[]='',res[]=')',res[]='\0';

     if(!strcmp(s,res))printf("Yes\n");
     else printf("No\n");
 }
 int main()
 {
     freopen("complexity.in","r",stdin);
     freopen("complexity.out","w",stdout);
     scanf("%d",&T);
     while(T--)
     {
         scanf("%d",&n);scanf("%s",s);
         Dealwith();
     }
     return ;
 }

NOIP2017 时间复杂度