NOIP-2017提高组1-时间复杂度★★★★★

题目描述

输入

输出

样例输入

8 
2 O(1) 
F i 1 1 
E 
2 O(n^1) 
F x 1 n 
E 
1 O(1) 
F x 1 n 
4 O(n^2) 
F x 5 n 
F y 10 n 
E 
E

4 O(n^2) 
F x 9 n 
E 
F y 2 n 
E 
4 O(n^1) 
F x 9 n 
F y n 4 
E 
E 
4 O(1) 
F y n 4 
F x 9 n 
E 
E 
4 O(n^2) 
F x 1 n 
F x 1 10 
E 
E

样例输出

Yes
Yes 
ERR 
Yes 
No 
Yes 
Yes 
ERR

#include <bits/stdc++.h>
using namespace std;
const int Max=300;
int t,n,m,Pow;
char ch[Max],s[Max];
inline int calc(char c,int &i)
{
	int x=0;
	for(;isdigit(s[i]) && s[i]!='n';i++) x=(x<<3)+(x<<1)+c-'0';
	return x;
}
inline int solve()
{
	int sum=0,len,maxx=0,flag=0,tot=0;  
	bool vis[Max],way[Max];   
	int p[Max];
	memset(vis,0,sizeof(vis)),memset(way,0,sizeof(way));
	while(n--)
	{
	  if(!tot) sum=0;
	  memset(s,0,sizeof(s));
	  gets(s+1),len=strlen(s+1);
	  if(s[1]=='E')
	  {
	  	if(!tot){flag=1;continue;}
	    maxx=max(maxx,sum);if(way[tot]) sum--,way[tot]=0;vis[p[tot--]]=0;continue;
	  }
	  if(vis[s[3]-'a']) flag=1;
	  p[++tot]=s[3]-'a'; 
	  vis[s[3]-'a']=1;
	  int st=0,to=0;
	  for(int i=5;i<=len;i++)
	  {
		if(!st)
		{
		  if(s[i]=='n') st=1000,i++;
		  else st=calc(s[i],i);
		}
		else
		{
		  if(s[i]=='n') to=1000,i++;
		  else to=calc(s[i],i);
		}
	  } 
	  if(st<to && to==1000) way[tot]=1,sum++;
	  else if(st>to) maxx=max(maxx,sum),sum=-100;
	}
	if(flag || sum>0 || tot>0) return -1;
	if(maxx==Pow) return 1;
	return 0;
}
int main(){
	scanf("%d\n",&t);
	for(int k=1;k<=t;k++)
	{
	  scanf("%d%s\n",&n,ch+1);
	  if(ch[3]=='1') Pow=0;
	  else sscanf(ch+1,"O(n^%d)",&Pow);
	  int flag = solve();
	  if(flag==1) cout<<"Yes\n";
	  else if(!flag) cout<<"No\n";
	  else cout<<"ERR\n"; 
	}
 
	return 0;
}