Source code for submission s527

fs.cpp

  1. #include <algorithm>
  2. #include <cctype>
  3. #include <cmath>
  4. #include <complex>
  5. #include <cstdio>
  6. #include <cstring>
  7. #include <iomanip>
  8. #include <iostream>
  9. #include <list>
  10. #include <map>
  11. #include <queue>
  12. #include <set>
  13. #include <sstream>
  14. #include <stack>
  15. #include <string>
  16. #include <utility>
  17.  
  18. using namespace std;
  19.  
  20. #define DEBUG(x) cout << ">>> " << #x << " : " << x << endl;
  21. #define REP(i,a) for (int i = 0; i < (a); ++i)
  22. #define FOR(i,a,b) for (int i = (a); i <= (b); ++i)
  23. #define FORD(i,a,b) for (int i = (a); i >= (b); --i)
  24. inline bool EQ(double a, double b) { return fabs(a-b) < 1e-9; }
  25. const int INF = 1<<29;
  26.  
  27. typedef long long ll;
  28.  
  29. bool encoded[5000];
  30. int lengths[1100];
  31. int encodedSize;
  32. int decodeNext;
  33. char output[1100];
  34.  
  35. void put(bool dash) {
  36. encoded[encodedSize++] = dash;
  37. }
  38.  
  39. void encode(int pos, char ch) {
  40. int l;
  41. switch (ch) {
  42. case 'A': l = 2; put(0); put(1); break;
  43. case 'B': l = 4; put(1); put(0); put(0); put(0); break;
  44. case 'C': l = 4; put(1); put(0); put(1); put(0); break;
  45. case 'D': l = 3; put(1); put(0); put(0); break;
  46. case 'E': l = 1; put(0); break;
  47. case 'F': l = 4; put(0); put(0); put(1); put(0); break;
  48. case 'G': l = 3; put(1); put(1); put(0); break;
  49. case 'H': l = 4; put(0); put(0); put(0); put(0); break;
  50. case 'I': l = 2; put(0); put(0); break;
  51. case 'J': l = 4; put(0); put(1); put(1); put(1); break;
  52. case 'K': l = 3; put(1); put(0); put(1); break;
  53. case 'L': l = 4; put(0); put(1); put(0); put(0); break;
  54. case 'M': l = 2; put(1); put(1); break;
  55. case 'N': l = 2; put(1); put(0); break;
  56. case 'O': l = 3; put(1); put(1); put(1); break;
  57. case 'P': l = 4; put(0); put(1); put(1); put(0); break;
  58. case 'Q': l = 4; put(1); put(1); put(0); put(1); break;
  59. case 'R': l = 3; put(0); put(1); put(0); break;
  60. case 'S': l = 3; put(0); put(0); put(0); break;
  61. case 'T': l = 1; put(1); break;
  62. case 'U': l = 3; put(0); put(0); put(1); break;
  63. case 'V': l = 4; put(0); put(0); put(0); put(1); break;
  64. case 'W': l = 3; put(0); put(1); put(1); break;
  65. case 'X': l = 4; put(1); put(0); put(0); put(1); break;
  66. case 'Y': l = 4; put(1); put(0); put(1); put(1); break;
  67. case 'Z': l = 4; put(1); put(1); put(0); put(0); break;
  68. case '_': l = 4; put(0); put(0); put(1); put(1); break;
  69. case ',': l = 4; put(0); put(1); put(0); put(1); break;
  70. case '.': l = 4; put(1); put(1); put(1); put(0); break;
  71. case '?': l = 4; put(1); put(1); put(1); put(1); break;
  72. default: exit(1); break;
  73. }
  74. lengths[pos] = l;
  75. }
  76.  
  77. void decode(int pos) {
  78. int l = lengths[pos];
  79. int val = 0;
  80. REP(i,l) {
  81. val *= 2;
  82. bool dash = encoded[decodeNext++];
  83. if (dash) ++val;
  84. }
  85. char letter = '\0';
  86. if (l == 1) {
  87. if (val) letter = 'T';
  88. else letter = 'E';
  89. } else if (l == 2) {
  90. switch (val) {
  91. case 0: letter = 'I'; break;
  92. case 1: letter = 'A'; break;
  93. case 2: letter = 'N'; break;
  94. case 3: letter = 'M'; break;
  95. }
  96. } else if (l == 3) {
  97. switch (val) {
  98. case 0: letter = 'S'; break;
  99. case 1: letter = 'U'; break;
  100. case 2: letter = 'R'; break;
  101. case 3: letter = 'W'; break;
  102. case 4: letter = 'D'; break;
  103. case 5: letter = 'K'; break;
  104. case 6: letter = 'G'; break;
  105. case 7: letter = 'O'; break;
  106. }
  107. } else {
  108. switch (val) {
  109. case 0: letter = 'H'; break;
  110. case 1: letter = 'V'; break;
  111. case 2: letter = 'F'; break;
  112. case 3: letter = '_'; break;
  113. case 4: letter = 'L'; break;
  114. case 5: letter = ','; break;
  115. case 6: letter = 'P'; break;
  116. case 7: letter = 'J'; break;
  117. case 8: letter = 'B'; break;
  118. case 9: letter = 'X'; break;
  119. case 10: letter = 'C'; break;
  120. case 11: letter = 'Y'; break;
  121. case 12: letter = 'Z'; break;
  122. case 13: letter = 'Q'; break;
  123. case 14: letter = '.'; break;
  124. case 15: letter = '?'; break;
  125. }
  126. }
  127. if (!letter) exit(2);
  128. output[pos] = letter;
  129. }
  130.  
  131. int main() {
  132. while (true) {
  133. char *input = NULL;
  134. size_t L;
  135. if (getline(&input, &L, stdin) < 0) break;
  136. L = strlen(input)-1;
  137. encodedSize = 0;
  138. decodeNext = 0;
  139. REP(i,L) encode(i, input[i]);
  140. for (int i = 0; i < L-i-1; ++i) swap(lengths[i], lengths[L-i-1]);
  141. REP(i,L) decode(i);
  142. output[L] = '\0';
  143. puts(output);
  144. }
  145. return 0;
  146. }
  147.