A13552. Tasty Cookie
编程题
普及/提高-
知识点
题目描述
由于本场题面违反互联网相关法律，不予展示原题面。
输入格式
无
输出格式
无
输入输出样例
输入 #1
2 5 7 5 7
输出 #1
SMALL 0
输入 #2
2 1 1 300000 1
输出 #2
BIG 299999
输入 #3
2 10 1 13 14
输出 #3
SMALL 6 RPPPRP
输入 #4
3 1 2 1 2 1 2
输出 #4
IMPOSSIBLE
说明/提示
In the first example, the arrays $A$ and $B$ already equal, so the number of required operations $=0$ .
In the second example, we need to replace $A$ with the prefix sums $299999$ times and then reverse the array. Since $299999>2\cdot 10^5$ , there is no need to restore the answer.
In the fourth example, you cannot get $B$ from the $A$ .
In the second example, we need to replace $A$ with the prefix sums $299999$ times and then reverse the array. Since $299999>2\cdot 10^5$ , there is no need to restore the answer.
In the fourth example, you cannot get $B$ from the $A$ .