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
#define setNodeId(x) {  }
#define setNumberOfNodes(x) {  }

//#define TEST
//#define ROLLING

#include "poszukiwania.h"
#include "message.h"

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>

using namespace std;
typedef long long lli;

const int NUMBER_OF_HASHES = 4;

const lli MOD = 2147483647;

lli primes[] = { 541, 104729, 1299709, 17686693, 1155487493 };

typedef lli (*TP)(lli);

struct HashConf
{
    lli base;
    bool shouldRand;

    lli removeMultiplication;

    HashConf(lli _base, lli _shouldRand)
    : base(_base), shouldRand(_shouldRand), removeMultiplication(0) { }
};

lli computed[NUMBER_OF_HASHES];
lli rolling[NUMBER_OF_HASHES];

HashConf hashConfs[NUMBER_OF_HASHES] = {
    HashConf(primes[0], false),
    HashConf(primes[2], false),
    HashConf(primes[3], false),
    HashConf( primes[4], false) };

lli power(lli value, lli pow){
    lli result = 1;
    for(lli mult = value; pow != 0; pow>>=1, mult = (mult*mult)%MOD ){
        if(pow & 1)
            result = (result * mult)%MOD;
        //cerr << "result "<<result<<" pow "<< pow<< " mult " << mult << "\n";
    }
    return result;
}

lli createHash(lli start, lli stop, TP t, HashConf& conf) {
    lli result = 0;
    for(lli i = start; i < stop; ++i){
        result = (result * conf.base)%MOD;
        lli current = t(i+1);
        if(conf.shouldRand) {
            srand((unsigned int)current);
            current = rand();
        }

        result = (result+current)%MOD;
    }
    return result;
}


lli rollHash(lli currentHash, lli start, lli stop, TP t, HashConf& conf) {
    if (conf.removeMultiplication == 0){
        conf.removeMultiplication = power(conf.base, stop-start);
        //cerr << "DDDDUPA" <<conf.base<<" "<< stop-start<<" "<< conf.removeMultiplication<<"\n"; exit(0);
    }
    currentHash = (currentHash*conf.base)%MOD;
    lli current = t(stop+1);
    if(conf.shouldRand) {
        srand((unsigned int)current);
        current = rand();
    }

    currentHash = (currentHash+current)%MOD;

    currentHash = ((currentHash - ((conf.removeMultiplication*t(start+1))%MOD))%MOD+MOD)%MOD;

    return currentHash;
}

void prepare(int i){
    int node = MyNodeId();
    if (node != i) return;
    if (node > 0 && node <= NUMBER_OF_HASHES)
    {
        lli hash = createHash(0, SignalLength(), SignalAt, hashConfs[node-1]);
#ifdef TEST
    cerr<<"Hash "<<i<<": "<<hash<<"\n";
#endif // TEST
        PutLL(0, hash);
        Send(0);
    }
}

void compute(int n){
    int node = MyNodeId();
    if( n != node ) return;
    int allNodes = NumberOfNodes();
    lli places = SeqLength()-SignalLength()+1;
    lli perNode = places/allNodes+1;
    lli start = node*perNode;
    lli stop = start+SignalLength();
    lli computeStop = start+perNode;
    if(computeStop+SignalLength() > SeqLength())
        computeStop = SeqLength()-SignalLength();


#ifdef TEST
    cerr<<"Node:"<<node<<" allNodes:"<<allNodes<<" places:"<<places<<" perNode:"<<perNode<<" start:"<<start<<" stop:"<<stop<<" computeStop:"<<computeStop<<"\n";
#endif // TEST

    if( start >= computeStop){
#ifdef TEST
    cerr<<"Putting 0\n";
#endif // TEST

        PutLL(0, 0);
        Send(0);
        return;
    }

    for(int i = 0; i < NUMBER_OF_HASHES; ++i)
        rolling[i] = createHash(start,stop, SeqAt, hashConfs[i]);

    lli result = 0;

    for(; start < computeStop; ++start, ++stop){
        bool fl = true;
#ifdef TEST
#ifdef ROLLING
    cerr<<"Rolling hashes for ix: "<<start;
#endif
#endif // TEST
        for(int i = 0; i < NUMBER_OF_HASHES; ++i){
            if( rolling[i] != computed[i] ) {
                fl = false;
#ifndef TEST
                break;
#endif
            }
#ifdef TEST
#ifdef ROLLING
    cerr<<" (#"<<i<<": "<<rolling[i]<<" "<<computed[i]<<")";
#endif // TEST
#endif // TEST
        }
#ifdef TEST
#ifdef ROLLING
    cerr<<"\n";
#endif // TEST
#endif // TEST
        if(fl) result++;


        for(int i = 0; i < NUMBER_OF_HASHES; ++i)
            if( stop+1 <= SeqLength())
                rolling[i] = rollHash(rolling[i],start, stop, SeqAt, hashConfs[i]);
    }

#ifdef TEST
    cerr<<"Putting "<<result<<"\n";
#endif // TEST

    PutLL(0, result);
    Send(0);
}

void receiveHashes(int n){
    if(n != MyNodeId()) return;
    Receive(0);
    for(int i =0 ; i < NUMBER_OF_HASHES; ++i){
        computed[i] = GetLL(0);
    }
}

void deterministic() {
    for(int i = 1; i <= NUMBER_OF_HASHES; ++i){
        setNodeId(i);
        prepare(i);
    }
#ifdef TEST
    cerr<<"Prepared\n";
#endif // TEST
    setNodeId(0);
    if(MyNodeId() == 0){
        for(int i = 1; i <= NUMBER_OF_HASHES; ++i){
            Receive(i);
            computed[i-1] = GetLL(i);
            for(int j = 1; j < NumberOfNodes(); ++j){
                PutLL(j,computed[i-1]);
            }
        }

        for(int j = 1; j < NumberOfNodes(); ++j){
            Send(j);
        }
    }

#ifdef TEST
    cerr<<"Hash sent\n";
#endif // TEST

    for(int j = 1; j < NumberOfNodes(); ++j){
        setNodeId(j);
        receiveHashes(j);
    }

#ifdef TEST
    cerr<<"Hash received\n";
#endif // TEST

    for(int j = 0; j < NumberOfNodes(); ++j){
        setNodeId(j);
        compute(j);
    }

#ifdef TEST
    cerr<<"Computing output ...\n";
#endif // TEST

    setNodeId(0);
    lli result = 0;
    if(MyNodeId() == 0){

        for(int j = 0; j < NumberOfNodes(); ++j){
            Receive(j);
            result += GetLL(j);
        }

        printf("%lli\n", result);
    }
}

int main() {
    setNumberOfNodes(10);
    deterministic();
  return 0;
}