[NOIP2017]时间复杂度(模拟)

sscanf读入数字，getline(cin,string)读一整行，其余暴力模拟即可。

 #include<cstdio>
 #include<string>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 #define rep(i,l,r) for (int i=(l); i<=(r); i++)
 typedef long long ll;
 using namespace std;

 const int N=;
 int T,n,w[N];
 char p[N],s[N];
 string str;

 int main(){
     freopen("comp.in","r",stdin);
     freopen("comp.out","w",stdout);
     for (scanf("%d",&T); T--; ){
         scanf("%d%s",&n,p); int d,ans=,top=; bool flag=;
         if (p[]=='') d=; else sscanf(p+,"%d",&d);
         rep(i,,n){
             if (flag) { getline(cin,str); continue; }
             scanf("%s",p);
             if (p[]=='F'){
                 scanf("%s",p); s[++top]=p[]; int x=,a,b;
                 scanf("%s",p); if (p[]=='n') a=; else sscanf(p,"%d",&a);
                 scanf("%s",p); if (p[]=='n') b=; else sscanf(p,"%d",&b);
                 if (a>b) w[top]=;
                     else if (a<b && b==) w[top]=; else w[top]=;
                 rep(j,,top-) if (s[j]==s[top]) flag=;
                 rep(j,,top){
                     if (!w[j]) break;
                     if (w[j]==) x++;
                 }
                 ans=max(ans,x);
             }else flag|=(--top<);
             scanf("\n");
         }
         flag|=top>; puts(flag?"ERR":ans==d?"Yes":"No");
     }
     return ;
 }