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

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

static long long nnn, mmm;
static int mmmy_id;
static long long *piii;

long long PPP(long long i)
{
        return SignalAt(i);
}

long long TTT(long long i)
{
        return SeqAt(i);
}

void compute_pi()
{
        long long k, q;

        piii[1] = 0;
        k = 0;
        for(q = 2; q <= mmm; ++q) {
                while (k > 0 && PPP(k+1) != PPP(q))
                        k = piii[k];
                if (PPP(k+1) == PPP(q)) {
                        k++;
                }
                piii[q] = k;
        }
}

long long kmp_search(long long s_beg, long long s_end)
{
        long long q, i, result;

        q = 0;
        result = 0;
        //for(i = 1; i <= n; ++i) {
        for(i = s_beg; i <= s_end+mmm-1; ++i) {
                while( q > 0 && PPP(q+1) != TTT(i)) {
                        q = piii[q];
                }
                if (PPP(q+1) == TTT(i)) {
                        q++;
                }
                if (q == mmm) {
                        result++;
                        q = piii[q];
//                        if (mmmy_id != 0) {
//                                PutLL(0, i - m + 1);
//                                Send(0);
//                        } else {
//                                printf("machine (0) found at pos %lld\n", i-m+1);
//                        }
                }
        }
        return result;
}

int main()
{
 //       Init();

        long long i, s, s_mach;
        long long mach_hi, mach_lo, mach;
        long long s_beg, s_end;
        long long a, b;
        long long result;

        mmm = SignalLength();
        nnn = SeqLength();
        mach = NumberOfNodes();
        mmmy_id = MyNodeId();

        piii = (long long*) malloc(sizeof(long long) * (mmm+1));
/*
        if (mmmy_id == 0) {
                printf("P len (%lld), T len (%lld)\n", m, n);
                printf("pattern");
                for(i = 1; i <= m; ++i) {
                        printf(" %lld", P(i));
                }
                printf("\n");

                printf("text");
                for(i = 1; i <= n; ++i) {
                        printf(" %lld", T(i));
                }
                printf("\n");
        }
*/
        s = nnn - mmm + 1;
        s_mach = s/mach;
/*
        if (mmmy_id == 0) {
                printf("pos to check (%lld)\n", s);
                printf("machines (%lld)\n", mach);
                printf("checks per machine (%lld)\n", s_mach);
        }
*/        
        mach_hi = s - s_mach * mach;
        mach_lo = mach - mach_hi;
/*
        if (mmmy_id == 0) {
                printf("(%lld) machines will check (%lld) pos, summary (%lld)\n", mach_hi, s_mach+1, mach_hi * (s_mach+1));
                printf("(%lld) machines will check (%lld) pos, summary (%lld)\n", mach_lo, s_mach,   mach_lo * s_mach);
        }
*/
        i = mmmy_id;
        if (i < mach_hi) {
                s_beg = i * (s_mach+1) + 1;
                s_end = s_beg + s_mach;
        } else {
                s_beg = mach_hi * (s_mach + 1) + (i-mach_hi) * s_mach + 1;
                s_end = s_beg + s_mach-1;
        }

/*        
        if (mmmy_id == 0) {
                printf("machine (%lld), checks from (%lld) to (%lld))\n", mmmy_id, s_beg, s_end);
                for(i = 1; i < mach; ++i) {
                        Receive(i);
                        a = GetLL(i);
                        b = GetLL(i);
                        printf("machine (%lld), checks from (%lld) to (%lld))\n", i, a, b);               
                }
        } else {
                PutLL(0, s_beg);
                PutLL(0, s_end);
                Send(0);
        }
*/

        compute_pi();
        //printf("%lld\n", kmp_search());

        if (s_beg <= s_end) {
                result = kmp_search( s_beg, s_end );
        } else {
                result = 0;
        }

        if (mmmy_id == 0) {

                for(i=1; i < mach; ++i) {
                        a = Receive(-1);
                        b = GetLL(a);
                        result += b;
                }
                printf("%lld\n", result);
        } else {
                PutLL(0, result);
                Send(0);
        }
        
        /*
        if (mmmy_id == 0) {
                for(i=0; i < 5; ++i) {
                        a = Receive(-1);
                        b = GetLL(a);
                        printf("machine (%lld) found at pos (%lld)\n", a, b);
                }
        }
*/
        return 0;
}