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
#include "poszukiwania.h"
#include "message.h"

#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include <iomanip>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define pb push_back

const long long p=1000000007, mod=1000000009;

long long powm(long long a, long long x)
{
    a%=mod;
    if(!x) return 1;
    if(x==1) return (a%mod);
    long long ret = powm((a*a)%mod,x/2);
    if(x%2) ret=(ret*a)%mod;
    return ret;
}

int h[20200000];

int main() {

    long long M = SeqLength();
    long long S = SignalLength();
    ll nodes = NumberOfNodes(), id=MyNodeId();
    //if (MyNodeId() > 0) return 0;

    long long res = 0;
    long long wzor=0, cur=0;
    ll st=(S*id)/nodes, en=(S*(id+1))/nodes; // range (st,en]
    for(int i=st+1; i<=en; i++) wzor=(wzor+SignalAt(i)*powm(p,i))%mod;

    // Hasz wzorca
    if (MyNodeId() > 0)
    {
        PutLL(0,wzor);
        Send(0);
        Receive(0);
        wzor=GetLL(0);
    }
    else
    {
        for(int i=1;i<nodes;i++)
        {
            Receive(i);
            wzor=(wzor+GetLL(i))%mod;
        }
        for(int i=1;i<nodes;i++)
        {
            PutLL(i,wzor);
            Send(i);
        }
    }

    //if (MyNodeId() == 0)
    //cerr << "hasz " << wzor << endl;

    // zakres poczatkow do sprawdzenia
    ll PP=M-S+1; // ile poczatkow do sprawdzenia
    st=(PP*id)/nodes;
    en=(PP*(id+1))/nodes; // range (st,en]

    ll sth=(M*id)/nodes, enh=(M*(id+1))/nodes; // range (st,en] haszy

    //cerr << "(" << sth << ", " << enh <<"]" << endl;

    // hasz kawalka
    cur = 0;
    for(ll i=sth+1;i<=enh;i++)
    {
        cur=(cur+SeqAt(i)*powm(p,i))%mod;
        h[i-sth]=cur;
    }
    //return 0;


    // przeslij kawalki zainteresowanym
    for(int i=0;i<nodes;i++)
    {
        ll pocz=(PP*i)/nodes, kon=pocz+S;
        pocz=max(pocz,sth);
        kon=min(kon,enh);
        ll temp=0;
        if(pocz<kon) temp=(h[kon-sth]-h[pocz-sth]+mod)%mod;
        PutLL(i,temp);
        Send(i);
    }
    // odbierz
    cur=0;
    for(int i=0;i<nodes;i++)
    {
        Receive(i);
        cur=(cur+GetLL(i))%mod;
    }

    // w cur jest hasz (st,st+S]
    wzor=(wzor*powm(p,st))%mod;
    if(st<en && cur==wzor) res++;
    for(ll i=st+S+1;i<=en+S-1;i++)
    {
        cur=(cur+SeqAt(i)*powm(p,i))%mod;
        if(i>S)
        {
            cur=((cur-SeqAt(i-S)*powm(p,i-S))%mod+mod)%mod;
            wzor=(wzor*p)%mod;
        }
        if(i>=S && cur==wzor) res++;
    }

    if (MyNodeId() > 0)
    {
        PutLL(0,res);
        Send(0);
    }
    else
    {
        for(int i=1;i<nodes;i++)
        {
            Receive(i);
            res=(res+GetLL(i))%mod;
        }
        cout << res << endl;
    }

    return 0;
}