CF——Catch Overflow!（模拟）

B. Catch Overflow!
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given a function f written in some basic language. The function accepts an integer value, which is immediately written into some variable x. x is an integer variable and can be assigned values from 0 to 232−1. The function contains three types of commands:

for n — for loop;
end — every command between “for n” and corresponding “end” is executed n times;
add — adds 1 to x.
After the execution of these commands, value of x is returned.

Every “for n” is matched with “end”, thus the function is guaranteed to be valid. “for n” can be immediately followed by “end”.“add” command can be outside of any for loops.

Notice that “add” commands might overflow the value of x! It means that the value of x becomes greater than 232−1 after some “add” command.

Now you run f(0) and wonder if the resulting value of x is correct or some overflow made it incorrect.

If overflow happened then output “OVERFLOW!!!”, otherwise print the resulting value of x.

Input
The first line contains a single integer l (1≤l≤105) — the number of lines in the function.

Each of the next l lines contains a single command of one of three types:

for n (1≤n≤100) — for loop;
end — every command between “for n” and corresponding “end” is executed n times;
add — adds 1 to x.
Output
If overflow happened during execution of f(0), then output “OVERFLOW!!!”, otherwise print the resulting value of x.

Examples
inputCopy
9
add
for 43
end
for 10
for 15
add
end
add
end
output
161

input
for 62
end
output
0

input
11
for 100
for 100
for 100
for 100
for 100
add
end
end
end
end
end
output
OVERFLOW!!!

Note
In the first example the first “add” is executed 1 time, the second “add” is executed 150 times and the last “add” is executed 10 times. Note that “for n” can be immediately followed by “end” and that “add” can be outside of any for loops.

In the second example there are no commands “add”, thus the returning value is 0.

In the third example “add” command is executed too many times, which causes x to go over 232−1.
PS题意:三种操作，add自加1，for类似循环从1到n，end结束对应循环。输出最终答案，如果大于2^32-1,则输出overflow
我做这道题的时候一直wrong 5 test，好像是爆栈了，栈爆longlong，后面看大佬们代码发现的。哎，好歹这场没爆零了。
思路：用栈来模拟即可，也可以用数组模拟栈，但要注意数据范围

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1ll << 32;
int main(){
	stack<ll>stack;
	stack.push(1);
	int n;
	ll x=0;
	string s;
	cin>>n;
	for(int i=0;i<n;i++){
         cin>>s;
		if(s=="add"){
			x=min(maxn,x+stack.top()); //溢出就直接取maxn 
		}
		else if(s=="for"){
			ll x;
			cin>>x;
			stack.push(min(stack.top()*x,maxn));//同上 
		}
		else{
			stack.pop();
		}
	}
    if(x==maxn)
	cout<<"OVERFLOW!!!"<<endl;
	else
	cout<<x<<endl;
	return 0;
}