1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
#include "message.h"
#include "poszukiwania.h"
#include <algorithm>
#include <iostream>
#include <iterator>
#include <random>
#include <vector>

long long S, M;
bool full_pattern = false;
int32_t pattern_size, text_size;
int32_t text_p, text_q, pattern_p, pattern_q;

inline long long pattern_at(const int32_t i) {
  if(pattern_p + i - 1 < 1 || pattern_p + i - 1 > S)
     return 1666777 + i;
  // std::cerr << "ZLA POZYCJA (PATTERN) --- " << pattern_p + i - 1 << '\n';
  return SignalAt(pattern_p+i-1);
 }

inline long long text_at(const int32_t i) {
  if(pattern_p + i - 1 < 1 || pattern_p + i - 1 > M)
      return 30666777 + i;
  //  std::cerr << "ZLA POZYCJA (TEXT) --- " << text_p + i - 1 << '\n';   
  return SeqAt(text_p + i - 1);
 }

bool check(const int32_t i) {
  if(full_pattern == true) {
    return true;
   }
  if(pattern_at(S) != text_at(i+S-1)) {
    return false;
   }
  for(unsigned x = pattern_size+1; x < S; x += (S-pattern_size)/2500) {
    if(pattern_at(x) != text_at(i + x -1)) {
      return false;
     }
   }
  return true;
 }



std::vector<int32_t> prefsuf() {
  std::vector<int32_t> result = {0,0};
  result.reserve(pattern_size);
  int32_t t = 0;
  for(int32_t i = 2; i <= pattern_size; ++i) {
    while(t > 0 && pattern_at(t+1) != pattern_at(i)) {
      t = result[t];
     }
    if(pattern_at(t+1) == pattern_at(i)) {
      t += 1;
     }
    result.push_back(t);
   }
  return result;
 }

int32_t fast_kmp(const std::vector<int32_t>& tab) {
  //std::vector<int32_t> result;
  int32_t result = 0;
  int32_t t = 0;
  //std::cerr << pattern_p << " ---> " << pattern_p + text_size << '\n';
  for(size_t i = 1; i <= text_size; ++i) {
     while(t > 0 && text_at(i) != pattern_at(t+1)) {
       t = tab[t];
      }
     if(pattern_at(t+1) == text_at(i)) {
       t += 1;
      }
     if(t == pattern_size) {
       if(check(i - pattern_size + 1) == true) {
         result += 1;//result.push_back(i - pattern_size+1);
        }
       t = tab[t];
      }
   }
  return result;
 }

int main() {
 const int my_id = MyNodeId(), nodes_number = NumberOfNodes();
  S = SignalLength();
  M = SeqLength();
  //std::cerr << "M = " << M << ", S = " << S << '\n';
  pattern_size = S;
  text_size = M;
  if(text_size < 8000000) {
    full_pattern = true;
    pattern_p = text_p = 1;
    pattern_q = S+1;
    text_q = M+1;
    if(my_id > 0) {
      return 0;
     }
    auto tab = prefsuf();
    const auto answer = fast_kmp(tab);
    std::cout << answer << '\n';
    return 0;
   }
  if(pattern_size <= 7500000) {
    full_pattern = true;
    int32_t text_interval = M - S + 1;
    text_interval /= nodes_number;
    //std::cerr << "Interval: " << text_interval << '\n';
    pattern_p = 1;
    pattern_q = S+1;
    text_p = 1 + text_interval * my_id;
    text_q = (nodes_number == my_id +1 ? M - S + 1 : text_p + text_interval);
    text_size = text_q - text_p + S - 1;
    //std::cerr << pattern_p << " " << pattern_q << " (" << pattern_size << ")\n";
    auto tab = prefsuf();
    const auto answer = fast_kmp(tab);
    PutLL(0, answer);
    Send(0);
    if(my_id > 0) {
      return 0;
     }
    int32_t global_answer = 0;
    for(unsigned i = 0; i < nodes_number; ++i) {
      int source = Receive(-1);
      global_answer += GetLL(source);
     }
    std::cout << global_answer << '\n';
    return 0;
   }
  if(true) {
    int32_t text_interval = M - S + 1;
    text_interval /= nodes_number;
    //std::cerr << "Interval: " << text_interval << '\n';
    pattern_p = 1;
    pattern_q = S+1;
    pattern_size = std::min(7500000LL, S);
    //if(M - pattern_size < 10000 && pattern_size > 250000) {
    //  pattern_size -= 250000;
    // }
    text_p = 1 + text_interval * my_id;
    text_q = (nodes_number == my_id +1 ? M - S + 1 : text_p + text_interval);
    text_size = text_q - text_p + pattern_size - 1;
    auto tab = prefsuf();
    const auto answer = fast_kmp(tab);
    PutLL(0, answer);
    Send(0);
    if(my_id > 0) {
      return 0;
     }
    int32_t global_answer = 0;
    for(unsigned i = 0; i < nodes_number; ++i) {
      int source = Receive(-1);
      global_answer += GetLL(source);
     }
    std::cout << global_answer << '\n';
    return 0;  
   }
 }