fork download
  1. #include <cstdio>
  2. #include <algorithm>
  3. #include <cstdlib>
  4.  
  5. typedef long long LL;
  6. const int MN = 200005, MS = 10000005;
  7.  
  8. int N;
  9. LL A[MN], B[MN];
  10. LL Ans[MS]; int C;
  11.  
  12. inline void check() {
  13. int ok1 = 1, ok2 = 1;
  14. for (int i = 1; i <= N; ++i) {
  15. if (A[i] != B[i]) ok1 = 0;
  16. if (A[i] != B[N - i + 1]) ok2 = 0;
  17. }
  18. if (!ok1 && ok2) ok1 = 1, Ans[++C] = -1;
  19. if (ok1) {
  20. LL tot1 = 0, tot2 = 0;
  21. for (int i = 1; i <= C; ++i)
  22. tot1 += Ans[i] == -1 ? 1 : Ans[i],
  23. tot2 += Ans[i] == -1 ? 0 : Ans[i];
  24. if (tot2 > 200000) printf("BIG\n%lld\n", tot2);
  25. else {
  26. printf("SMALL\n%lld\n", tot1);
  27. for (int i = C; i >= 1; --i) {
  28. if (Ans[i] == -1) putchar('R');
  29. else {
  30. int x = Ans[i];
  31. while (x) putchar('P'), --x;
  32. }
  33. }
  34. putchar('\n');
  35. }
  36. exit(0);
  37. }
  38. }
  39.  
  40. int main() {
  41. scanf("%d", &N);
  42. for (int i = 1; i <= N; ++i) scanf("%lld", &A[i]);
  43. for (int i = 1; i <= N; ++i) scanf("%lld", &B[i]);
  44. check();
  45. if (N == 1) {
  46. if (A[1] == B[1]) puts("SMALL\n0\n");
  47. else puts("IMPOSSIBLE");
  48. return 0;
  49. }
  50. if (N == 2) {
  51. if (B[1] == B[2]) return puts("IMPOSSIBLE"), 0;
  52. while (1) {
  53. // printf("(%lld, %lld)\n", B[1], B[2]);
  54. if (B[1] > B[2]) std::swap(B[1], B[2]), Ans[++C] = -1;
  55. if (A[1] == B[1]) {
  56. LL diff = B[2] - A[2];
  57. if (diff < 0 || diff % B[1] != 0) return puts("IMPOSSIBLE"), 0;
  58. Ans[++C] = diff / B[1];
  59. break;
  60. }
  61. if (A[2] == B[1]) {
  62. LL diff = B[2] - A[1];
  63. if (diff < 0 || diff % B[1] != 0) return puts("IMPOSSIBLE"), 0;
  64. Ans[++C] = diff / B[1];
  65. Ans[++C] = -1;
  66. break;
  67. }
  68. if (B[2] % B[1] == 0) return puts("IMPOSSIBLE"), 0;
  69. Ans[++C] = B[2] / B[1];
  70. B[2] %= B[1];
  71. }
  72. LL tot1 = 0, tot2 = 0;
  73. for (int i = 1; i <= C; ++i)
  74. tot1 += Ans[i] == -1 ? 1 : Ans[i],
  75. tot2 += Ans[i] == -1 ? 0 : Ans[i];
  76. if (tot2 > 200000) printf("BIG\n%lld\n\n", tot2);
  77. else {
  78. printf("SMALL\n%lld\n", tot1);
  79. for (int i = C; i >= 1; --i) {
  80. if (Ans[i] == -1) putchar('R');
  81. else {
  82. int x = Ans[i];
  83. while (x) putchar('P'), --x;
  84. }
  85. }
  86. putchar('\n');
  87. }
  88. return 0;
  89. }
  90. while (1) {
  91. if (B[1] == B[N]) return puts("IMPOSSIBLE"), 0;
  92. if (B[1] > B[N]) {
  93. std::reverse(B + 1, B + N + 1), Ans[++C] = -1;
  94. } else {
  95. int ok = 1;
  96. for (int i = 2; i <= N; ++i)
  97. if (B[i - 1] >= B[i]) ok = 0;
  98. if (!ok) return puts("IMPOSSIBLE"), 0;
  99. for (int i = N; i >= 2; --i)
  100. B[i] -= B[i - 1];
  101. Ans[++C] = 1;
  102. }
  103. // printf("\t\t\t"); for (int i = 1; i <= N; ++i) printf("%lld, ", B[i]); puts("");
  104. check();
  105. }
  106. return 0;
  107. }
Success #stdin #stdout 0s 4516KB
stdin
Standard input is empty
stdout
SMALL
0