Source code for submission s684

bugs.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. #include <vector>
  18.  
  19. using namespace std;
  20. #define DEBUG(x) cerr << ">>> " << #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.  
  26. const int INF = 1<<29;
  27. typedef long long ll;
  28. //////////////////////////////////
  29.  
  30. #define MAXN 2222
  31. int shift[MAXN];
  32. int len;
  33. char input[MAXN];
  34. void kmp_init(){
  35. len = strlen(input);
  36. shift[0] = -1;
  37. for(int i = 0 , j = -1; i < len - 1; shift[++i] = ++j) while(j >= 0 && input[i] != input[j]) j = shift[j];
  38. }
  39.  
  40. int N;
  41. char buf[2222222];
  42. int fail[2222222];
  43. void solve(){
  44. int pos = 0;
  45. fail[0] = -1;
  46. for(int i = 0; buf[i] != '\0'; i++){
  47. buf[pos] = buf[i];
  48. fail[pos + 1] = fail[pos];
  49. if(input[fail[pos+1] + 1] == buf[i]) fail[pos+1]++;
  50. else{
  51. while(fail[pos + 1] >= 0 && buf[i] != input[fail[pos+1]]) fail[pos+1] = shift[fail[pos+1]];
  52. }
  53. pos++;
  54. if(fail[pos] == len - 1) pos -= len;
  55. }
  56. buf[pos] = '\0';
  57. printf("%s\n", buf);
  58. }
  59.  
  60. int main() {
  61. while(scanf("%d %s", &N, input) != EOF){
  62. kmp_init();
  63. gets(buf);
  64. REP(i, N){
  65. gets(buf);
  66. solve();
  67. }
  68. }
  69. return 0;
  70. }
  71.