CF1358F.Tasty Cookie

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

由于本场题面违反互联网相关法律，不予展示原题面。

输入格式

无

输出格式

无

输入输出样例

输入#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$ .

首页