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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
#include "poszukiwania.h"
#include "message.h"
#include <iostream>

using namespace std;
//SIG <= SEQ
long long brute(long long seq, long long sig) {
  long long count = 0;
  for(int i = 1; i <= seq; i++) {
    bool same = true;
    for(int j = 1; j <= sig; j++){
      if(i-1+j > seq || SignalAt(j) != SeqAt(i-1+j)) {
        same = false;
        break;
      }
    }  
    if(same) count++;    
  }
  return count;
}

long long wykl[]= {101051, 102199, 101383, 102217, 102229};
long long primes[] = {1000000087, 1000001333, 1000003601, 1000004207, 1000004233};

long long count_hash(int hash_nr, long long MIN, long long MAX, long long (*fun)(long long)) {
  long long hash = 0;
  long long wyk = wykl[hash_nr];
  long long prime = primes[hash_nr];
  long long it = 0;
  for(long long i = MAX; i >= MIN; i--) {
    hash = ((wyk * hash)%prime + (*fun)(i)) % prime;
    it++;
  }
  //printf("it %lld\n", it);
  return hash;
}

long long pow(long long k, long long wykl, long long mod) {
  if(k == 1) return wykl;
  if(k <= 0) return 1;
  if(k%2==1) return (wykl * pow(k/2, (wykl * wykl)% mod, mod)) % mod;
  return pow(k/2, (wykl * wykl)% mod, mod);
}
int HASHES = 2;
struct HASH{
  long long hash[5];
};
HASH hashes_seq[1000];
HASH hashes_sig[1000];

HASH sig_hash;
HASH seq_hash;
long long len_sig;
long long start_sig;
long long end_sig;
long long len_seq;
long long start_seq;
long long end_seq;
long long nodes = 0;
long long id = 0;
long long SEQ, SIG;
void sendRes(long long res) {
  PutLL(0, res);
  Send(0);
}
long long getRes() {
  long long res = 0;
  for(int i=1; i<nodes; i++){
    Receive(i);
    res += GetLL(i);
  }
  return res;
}
void get_hashes(HASH *hashes) {
  for(int i=1; i<nodes; i++){
    Receive(i);
    for(int j = 0; j<HASHES; j++){
      hashes[i].hash[j] = GetLL(i);
    }
  }
}

void final_get_hashes(HASH *hashes) {
  Receive(0);
  for(int j=0; j<nodes; j++) {
    for(int k = 0; k<HASHES; k++){
      hashes[j].hash[k] = GetLL(0);
    }
  }
}
void set_hashes(HASH *hashes) {
  for(int i=1; i<nodes; i++){
    for(int j=0; j<nodes; j++) {
      for(int k = 0; k<HASHES; k++){
        PutLL(i, hashes[j].hash[k]);
      }
    }
    Send(i);
  }
}

void send_hashes_sig(HASH *hashes) {
    for(int j = 0; j<HASHES; j++){
      PutLL(0, sig_hash.hash[j]);
    }
    Send(0);
}
void send_hashes_seq(HASH *hashes) {
    for(int j = 0; j<HASHES; j++){
      PutLL(0, seq_hash.hash[j]);
    }
    Send(0);
}

void get_sig_hash() {
  Receive(0);
  for(int j = 0; j<HASHES; j++){
    sig_hash.hash[j] = GetLL(0);
  }
}


void set_sig_hash() {
  for(int i=1; i<nodes; i++){
    for(int j = 0; j<HASHES; j++){
      PutLL(i, sig_hash.hash[j]);
    }
    Send(i);
  }
}

void count_sig_hash(){
    for(int j = 0; j<HASHES; j++){
      sig_hash.hash[j] = count_hash(j, start_sig, end_sig, &SignalAt);
      //printf("sig_hash %lld\n", sig_hash.hash[j]);
    }

}

void count_seq_hash(){
    for(int j = 0; j<HASHES; j++){
      seq_hash.hash[j] = count_hash(j, start_seq, end_seq, &SeqAt);
      hashes_seq[id].hash[j] = seq_hash.hash[j];
      //printf("seq_hash %lld\n", seq_hash.hash[j]);
    }

}

long long get_start_sig(long long ID){
  return 1 + ID * len_sig;
}
long long get_start_seq(long long ID){
  return 1 + ID * len_seq;
}

long long get_end_sig(long long ID, long long START_SIG) {
  long long END_SIG = START_SIG + len_sig - 1;

  if(END_SIG > SIG && START_SIG > SIG) {
    END_SIG = START_SIG-1;
  } else if (END_SIG > SIG) {
    END_SIG = SIG;
  }
  return END_SIG;
}
long long get_end_seq(long long ID, long long START_SEQ) {
  long long END_SEQ = START_SEQ + len_seq - 1;

  if(END_SEQ > SEQ && START_SEQ > SEQ) {
    END_SEQ = START_SEQ-1;
  } else if (END_SEQ > SEQ) {
    END_SEQ = SEQ;
  }
  return END_SEQ;
}

void count_total_sig_hash() {
  for(int j = 0; j<HASHES; j++){
    hashes_sig[0].hash[j] = sig_hash.hash[j];
    long long h = 0;
    for(int i = nodes - 1; i >= 0; i--){
      h = (h + (hashes_sig[i].hash[j] * pow(get_start_sig(i) - 1, wykl[j], primes[j])) % primes[j]) % primes[j];
      //printf("sig_hash update %lld, hash %lld, pow %lld\n", h, hashes_sig[i].hash[j], pow(get_start_sig(i) - 1, wykl[j], primes[j]));
    }
    sig_hash.hash[j] = h;
  }
}

void print_hashes(HASH *hash) {
  for(int i=0; i<nodes; i++) {
    for(int j = 0; j<HASHES; j++)
      printf("HASH SEQ %lld\n", hash[i].hash[j]);
  }
}

long long fast_hash(int hash_nr, long long start_seq, long long end_seq){
  int nr = id + 1;
  long long sum_hash = 0;
  long long start = get_start_seq(nr);
  long long end = get_end_seq(nr , start);

  long long prime = primes[hash_nr];
  long long wyk = wykl[hash_nr];

  long long power = 1;
  
  long long ws = start_seq;
  while(ws<start&&ws <=end_seq){
    sum_hash = (sum_hash + (SeqAt(ws) * power)%prime) % prime;
    power = (power * wyk) % prime;
    ws++;
  }
  
  if(ws == end_seq) return sum_hash;
  
  int it = 0;
  
  while(end_seq> end && start<=end){
    sum_hash = (sum_hash + (power * hashes_seq[nr].hash[hash_nr])%prime) % prime;
    power = (power * pow(end - start + 1, wyk, prime)) % prime;
    nr++;
    start = get_start_seq(nr);
    end = get_end_seq(nr , start);
    it++;
  }
  
//  printf("IT %d\n", it);
//  if(end < start)
//    return sum_hash;
  
  ws = start;
  
  while(ws <= end_seq){
    sum_hash = (sum_hash + (SeqAt(ws) * power)%prime) % prime;
    power = (power * wyk) % prime;
    ws++;
  }

  
  return sum_hash;
}

long long solve(){
  long long res = 0;
  HASH hash_sum;
  HASH expected = sig_hash;
  HASH pow_low;
  HASH pow_high;
  bool s = true;
  for(int j = 0; j<HASHES; j++){
    if(start_seq + SIG-1 >SEQ) return 0;
    hash_sum.hash[j] = fast_hash(j, start_seq, start_seq + SIG-1);
    
    //count_hash(j, start_seq, start_seq + SIG-1, &SeqAt);
    pow_low.hash[j] = 1;
    pow_high.hash[j] = pow(SIG, wykl[j], primes[j]);
   //printf("hash %lld, real hash %lld, expected %lld\n", hash_sum.hash[j], count_hash(j, start_seq, start_seq + SIG-1, &SeqAt), expected.hash[j]);
    if(hash_sum.hash[j]!=expected.hash[j] || start_seq + SIG-1 >SEQ)s = false;
  }
  if(s) res++;
  for(long long it = start_seq + 1; it <= end_seq && (it + SIG -1) <= SEQ; it++){
    bool same = true;
    for(int j = 0; j<HASHES; j++){
      expected.hash[j] = (expected.hash[j] * wykl[j]) % primes[j];
      hash_sum.hash[j] = ((hash_sum.hash[j] - (pow_low.hash[j] * SeqAt(it - 1)) % primes[j])%primes[j] + (pow_high.hash[j] * SeqAt(it + SIG - 1))%primes[j] + primes[j]) % primes[j];
      pow_low.hash[j] = (pow_low.hash[j] * wykl[j]) % primes[j];
      pow_high.hash[j] = (pow_high.hash[j] * wykl[j]) % primes[j];
      //printf("hash %lld, expected %lld, real %lld, end %lld, hard end %lld\n", hash_sum.hash[j], expected.hash[j], count_hash(j, it, it + SIG -1 , &SeqAt), it + SIG - 1, SEQ);
      if(expected.hash[j] != hash_sum.hash[j]
        //count_hash(j, it, it + SIG -1 , &SeqAt)
      ){  
        same = false;  
      }
    }
    if(same)
      res++; 
  }
  return res;
}
int main() {


  long long RES = 0;
  SEQ = SeqLength();
  SIG = SignalLength();
//SIG <= SEQ
  id = MyNodeId();
  nodes = NumberOfNodes();
  len_sig = 1 + (SIG - 1) / nodes;
  start_sig = get_start_sig(id);
  end_sig = get_end_sig(id, start_sig);

  len_seq = 1 + (SEQ - 1) / nodes;
  start_seq = get_start_seq(id);
  end_seq = get_end_seq(id, start_seq);
    
  count_sig_hash();
  count_seq_hash();
 
//printf("start_sig %lld, end_sig %lld\n", start_sig, end_sig);
//printf("start_seq %lld, end_seq %lld\n", start_seq, end_seq);

  if (MyNodeId() > 0) {
    send_hashes_sig(hashes_sig);
    get_sig_hash();
    send_hashes_seq(hashes_seq);  
    
    final_get_hashes(hashes_seq);
    //sum results
    RES = solve();
    sendRes(RES);
  } else {
 
    //for(int i = 0; i < HASHES; i++){
    //  printf("hash nr: %d hash sig: %lld\n", i, count_hash(i, 1, SIG, &SignalAt));
    //}
    //printf("hash seq: %lld\n", count_hash(0, 1, SEQ, &SeqAt));

    // get_hases
    get_hashes(hashes_sig);
    count_total_sig_hash();
    set_sig_hash();
    get_hashes(hashes_seq);
    
    set_hashes(hashes_seq);
    //sum results
    RES = solve();
    RES += getRes();
    //
    printf("%lld\n", RES);
    //printf("brute: %lld\n", brute(SEQ, SIG));
  }
  //for(int i = 0; i < HASHES; i++){
  //  printf("nr: %d hash sig parallel: %lld\n", i, sig_hash.hash[i]);
  //}

  //print_hashes(hashes_seq);
 
}