HDU 5063 Operation the Sequence(暴力)

蒙蔽，讲道理第二种空间比第一种用的少，时间也应该少，为啥就TLE了

#include<iostream>
#include<cstdio>
#include<set>
#include<string>
#include<string.h>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<algorithm>
#include<sstream>
#include<utility>
#include<cmath>
#include<functional>
#define mt(a) memset(a,0,sizeof (a))
#define fl(a,b,c) fill(a,b,c)
#define SWAP(a,b,t) (t=a,a=b,b=t)

#define MOD 1000000000+7

using namespace std;
typedef long long ll;
ll n, i;
int po[100000+20], pos = 0;

int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		int n, m;
		cin >> n >> m;
		int pos = 0;
		mt(po);
		char ch[2]; ll x;
		for (int i = 0; i < m; i++)
		{
			scanf("%s %lld", ch, &x);
			if (ch[0] == 'O')
			{
				if(x==1)po[i]=1;
				else if(x==2)po[i]=2;
				else po[i]=3;
			}
			else if (ch[0] == 'Q')
			{
				int mul = 0;
				for (int j = i - 1; j >= 0; j--)
				{
					if (po[j] == 2)
					{
						x = (n + 1 - x);
					}
					else if (po[j] == 1)
					{
						if(n%2)
                        {
                            if(x<=(n+1)/2) x=x*2-1;
                            else x=2*x-n-1;
                        }
                        else
                        {
                            if(x<=n/2)x=x*2-1;
                            else x=2*x-n;
                        }
					}
					else if (po[j] == 3)mul++;
				}
				for (int j = 0; j < mul; j++)
				{
					x *= x;
					x %= MOD;
				}
				printf("%I64d\n", x);
			}
		}
	}
	return 0;
}

第二种

#include<iostream>
#include<cstdio>
#include<set>
#include<string>
#include<string.h>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<algorithm>
#include<sstream>
#include<utility>
#include<cmath>
#include<functional>
#define mt(a) memset(a,0,sizeof (a))
#define fl(a,b,c) fill(a,b,c)
#define SWAP(a,b,t) (t=a,a=b,b=t)

#define MOD 1000000000+7

using namespace std;
typedef long long ll;
ll n, i;
int po[55], pos = 0;

int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		int n, m;
		cin >> n >> m;
		int pos = 0;
		char ch[2]; ll x;
		for (int i = 0; i < m; i++)
		{
			scanf("%s %lld", ch, &x);
			if (ch[0] == 'O')
			{
				po[pos++] = x;
			}
			else if (ch[0] == 'Q')
			{
				int mul = 0;
				for (int j = pos - 1; j >= 0; j--)
				{
					if (po[j] == 2)
					{
						x = (n + 1 - x);
					}
					else if (po[j] == 1)
					{
						if (n & 1)
						{
							if (x > n / 2 + 1)x = (x - n / 2 - 1) * 2;
							else x = 2 * x - 1;
						}
						else
						{
							if (x > n / 2)x = (x - (n / 2)) * 2;
							else x = 2 * x - 1;
						}
					}
					else if (po[j] == 3)mul++;
				}
				for (int j = 0; j < mul; j++)
				{
					x *= x;
					x %= MOD;
				}
				printf("%lld\n", x);
			}
		}
	}
	return 0;
}