Educational Codeforces Round 66 (Rated for Div. 2) B. Catch Overflow!

链接：https://codeforces.com/contest/1175/problem/B

题意：

You are given a function ff written in some basic language. The function accepts an integer value, which is immediately written into some variable xx. xx is an integer variable and can be assigned values from 00 to 232−1232−1. The function contains three types of commands:

for nn — for loop;
end — every command between "for nn" and corresponding "end" is executed nn times;
add — adds 1 to xx.

After the execution of these commands, value of xx is returned.

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

Notice that "add" commands might overflow the value of xx! It means that the value of xxbecomes greater than 232−1232−1 after some "add" command.

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

If overflow happened then output "OVERFLOW!!!", otherwise print the resulting value of xx.

思路：

模拟，我用递归写的。

用stack也可以

代码：

#include <bits/stdc++.h>
using namespace std;typedef long long LL;
const unsigned int MAXV = (1LL<<32)-1;
const int MAXN = 1e5+10;
int n;
bool flag = true;struct Op
{string op;LL va;
}oper[MAXN];
int step = 1;LL Dfs(LL lops)
{if (step > n)return 0;LL res = 0;while (oper[step].op[0] == 'a'){step++;res++;}
//    cout << "res1:" << res << endl;while (oper[step].op[0] == 'f'){res += Dfs(oper[step++].va);if (res > MAXV)flag = false;while (oper[step].op[0] == 'a'){step++;res++;}}
//    cout << "res2:" << res << endl;if (1LL*lops*res > MAXV)flag = false;
//    cout << "res3:" << lops*res << ' ' << step << endl;step++;return lops*res;
}int main()
{
//    freopen("test.in", "r", stdin);cin >> n;for (int i = 1;i <= n;i++){cin >> oper[i].op;if (oper[i].op[0] == 'f')cin >> oper[i].va;}LL res = Dfs(1);if (!flag)cout << "OVERFLOW!!!" << endl;elsecout << res << endl;return 0;
}

转载于:https://www.cnblogs.com/YDDDD/p/10984224.html

Educational Codeforces Round 66 (Rated for Div. 2) B. Catch Overflow!相关推荐

Educational Codeforces Round 66 (Rated for Div. 2)
题意:求最小操作数使得归零两种操作 1 减一 2能被k整除的时候除k 签到题: 记得开ll即可 #include<bits/stdc++.h> using namespace ...
Educational Codeforces Round 90 (Rated for Div. 2)（A, B, C, D, E）
Educational Codeforces Round 90 (Rated for Div. 2) Donut Shops 思路分三种情况: a==c/ba == c / ba==c/b这个时候两 ...
Educational Codeforces Round 114 (Rated for Div. 2) （A ~ F）全题解
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Educational Codeforces Round 114 (Rated for Div. 2) ...
Educational Codeforces Round 106 (Rated for Div. 2)（A ~ E）题解（每日训练 Day.16 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划目录 Educational Codeforces Round 106 (Rated for Div. ...
Educational Codeforces Round 37 (Rated for Div. 2) 1
Educational Codeforces Round 37 (Rated for Div. 2) A.Water The Garden 题意:Max想给花园浇水.花园可被视为长度为n的花园床,花园 ...
Educational Codeforces Round 89 (Rated for Div. 2)（A, B, C, D）
Educational Codeforces Round 89 (Rated for Div. 2) A. Shovels and Swords 思路题意非常简单,就是得到最多的物品嘛,我们假定a, ...
Educational Codeforces Round 114 (Rated for Div. 2) D. The Strongest Build 暴力 + bfs
传送门文章目录题意: 思路: 题意: 你有nnn个装备槽,每个槽里面有cic_ici个力量加成,对于每个槽只能选一个力量加成,现在给你mmm个力量组合[b1,b2,...,bn][b_1,b_2 ...
Educational Codeforces Round 72 (Rated for Div. 2) D. Coloring Edges dfs树/拓扑找环
传送门文章目录题意: 思路: 题意: 给你一张图,你需要给这个图的边染色,保证如果有环那么这个环内边的颜色不全相同,输出染色方案和用的颜色个数. n,m≤5e3n,m\le5e3n,m≤5e3 思 ...
Educational Codeforces Round 111 (Rated for Div. 2) D. Excellent Arrays 组合数学
传送门文章目录题意: 思路: 题意: 给你一个数组aia_iai,定义一个数组是好的当且仅当对于所有iii都有ai!=ia_i!=iai!=i.定义f(a)f(a)f(a)表示数组aaa中i& ...

Educational Codeforces Round 66 (Rated for Div. 2) B. Catch Overflow!

链接：https://codeforces.com/contest/1175/problem/B

题意：

思路：

代码：

Educational Codeforces Round 66 (Rated for Div. 2) B. Catch Overflow!相关推荐

最新文章

热门文章