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
#include "poszukiwania.h"
//#include "poszukiwania-test.h"
#include "message.h"
#include <algorithm>
#include <map>
#include <iostream>
using namespace std;
const int mo1=1012234523,mo2=1051432141,mo3=1069393951;
const int s1=1000100009,s2=1000200001,s3=1000300003;

typedef long long ll;
ll S,M;

inline int qp(int a,int b,int mo){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}


int lis[205];int ltot;
int lisr1[205],lisr2[205],lisr3[205];
int hq1[111],hq2[111],hq3[111];
map<int,int>ma1,ma2,ma3;
int main() {
	M = SeqLength();
	S = SignalLength();
	int bg=1ll*S*MyNodeId()/NumberOfNodes(),ed=1ll*S*(MyNodeId()+1)/NumberOfNodes();
	int res1=0,res2=0,res3=0;
	for (register int i=bg;i<ed;i++){
		res1=(1ll*res1*s1+SignalAt(i+1))%mo1;
		res2=(1ll*res2*s2+SignalAt(i+1))%mo2;
		res3=(1ll*res3*s3+SignalAt(i+1))%mo3;
	}

	PutInt(0,res1);
	PutInt(0,res2);
	PutInt(0,res3);
	Send(0);

	if(MyNodeId()==0){
		int r1=0,r2=0,r3=0;
		for (int i=0;i<NumberOfNodes();i++){
			int ed=1ll*S*(i+1)/NumberOfNodes();
			Receive(i);
			int x1=GetInt(i),x2=GetInt(i),x3=GetInt(i);
			r1=(r1+1ll*x1*qp(s1,S-ed,mo1))%mo1;
			r2=(r2+1ll*x2*qp(s2,S-ed,mo2))%mo2;
			r3=(r3+1ll*x3*qp(s3,S-ed,mo3))%mo3;
		}
		for (int i=0;i<NumberOfNodes();i++){
			PutInt(i,r1);
			PutInt(i,r2);
			PutInt(i,r3);
			Send(i);
		}
	}

	int g1,g2,g3;
	Receive(0);g1=GetInt(0),g2=GetInt(0),g3=GetInt(0);
	/////////////////////
	bg=1ll*M*MyNodeId()/NumberOfNodes(),ed=1ll*M*(MyNodeId()+1)/NumberOfNodes();
//calc need point
	ltot=0;
	for (int i=0;i<NumberOfNodes();i++){
		int r=S-1+1ll*(M-S+1)*i/NumberOfNodes();
		int l=r-S;
		if(bg<=r && r<ed)lis[++ltot]=r;
		if(bg<=l && l<ed)lis[++ltot]=l;
	}
	sort(lis+1,lis+1+ltot);
// calc q
	res1=res2=res3=0;

	lis[0]=bg-1;
	lis[ltot+1]=ed-1;
	for (int nu=1;nu<=ltot+1;nu++){
		int le=lis[nu-1]+1,ri=lis[nu];
		for (register int i=le;i<=ri;i++){
			res1=(1ll*res1*s1+SeqAt(i+1))%mo1;
			res2=(1ll*res2*s2+SeqAt(i+1))%mo2;
			res3=(1ll*res3*s3+SeqAt(i+1))%mo3;
		}
		lisr1[nu]=res1,lisr2[nu]=res2,lisr3[nu]=res3;
	}
	
	PutInt(0,lisr1[ltot+1]);
	PutInt(0,lisr2[ltot+1]);
	PutInt(0,lisr3[ltot+1]);
	Send(0);

	if(MyNodeId()==0){
		for (int i=0;i<NumberOfNodes();i++){
			Receive(i);
			hq1[i]=GetInt(i);
			hq2[i]=GetInt(i);
			hq3[i]=GetInt(i);
		}
		for (int i=1;i<NumberOfNodes();i++){
			int lei=1ll*M*(i+1)/NumberOfNodes()-1ll*M*i/NumberOfNodes();
			hq1[i]=(1ll*hq1[i-1]*qp(s1,lei,mo1)+hq1[i])%mo1;
			hq2[i]=(1ll*hq2[i-1]*qp(s2,lei,mo2)+hq2[i])%mo2;
			hq3[i]=(1ll*hq3[i-1]*qp(s3,lei,mo3)+hq3[i])%mo3;
		}
		
		for (int i=1;i<NumberOfNodes();i++){
			PutInt(i,hq1[i-1]);
			PutInt(i,hq2[i-1]);
			PutInt(i,hq3[i-1]);
			Send(i);
		}
	}

	int pre1=0,pre2=0,pre3=0;
	if(MyNodeId()!=0){
		Receive(0);
		pre1=GetInt(0);
		pre2=GetInt(0);
		pre3=GetInt(0);
	}

	PutInt(0,ltot);
	for (int i=1;i<=ltot;i++){
		int t1,t2,t3;
		t1=(1ll*pre1*qp(s1,lis[i]-bg+1,mo1)+lisr1[i])%mo1;
		t2=(1ll*pre2*qp(s2,lis[i]-bg+1,mo2)+lisr2[i])%mo2;
		t3=(1ll*pre3*qp(s3,lis[i]-bg+1,mo3)+lisr3[i])%mo3;
		PutInt(0,lis[i]);
		PutInt(0,t1);
		PutInt(0,t2);
		PutInt(0,t3);
	}
	Send(0);

	if(MyNodeId()==0){
		ma1[-1]=ma2[-1]=ma3[-1]=0;
		for (int i=0;i<NumberOfNodes();i++){
			Receive(i);
			int to=GetInt(i);
			while(to--){
				int x;
				x=GetInt(i);
				ma1[x]=GetInt(i);
				ma2[x]=GetInt(i);
				ma3[x]=GetInt(i);
			}
		}
		for (int i=0;i<NumberOfNodes();i++){
			int r=S-1+1ll*(M-S+1)*i/NumberOfNodes();
			int l=r-S;
			int ha1=((ma1[r]-1ll*ma1[l]*qp(s1,S,mo1))%mo1+mo1)%mo1;
			int ha2=((ma2[r]-1ll*ma2[l]*qp(s2,S,mo2))%mo2+mo2)%mo2;
			int ha3=((ma3[r]-1ll*ma3[l]*qp(s3,S,mo3))%mo3+mo3)%mo3;
			PutInt(i,ha1);
			PutInt(i,ha2);
			PutInt(i,ha3);
			Send(i);
		}
	}

	bg=S-1+1ll*(M-S+1)*MyNodeId()/NumberOfNodes(),ed=S-1+1ll*(M-S+1)*(MyNodeId()+1)/NumberOfNodes();
	int ha1,ha2,ha3;
	Receive(0);
	ha1=GetInt(0);
	ha2=GetInt(0);
	ha3=GetInt(0);

	int ans=0;
	int minu1=(mo1-qp(s1,S,mo1))%mo1;
	int minu2=(mo2-qp(s2,S,mo2))%mo2;
	int minu3=(mo3-qp(s3,S,mo3))%mo3;
	if(bg<ed && ha1==g1 && ha2==g2 && ha3==g3)ans++;
	for (register int i=bg+1;i<ed;i++){
		ha1=(1ll*ha1*s1+1ll*SeqAt(i-S+1)*minu1+SeqAt(i+1))%mo1;
		ha2=(1ll*ha2*s2+1ll*SeqAt(i-S+1)*minu2+SeqAt(i+1))%mo2;
		ha3=(1ll*ha3*s3+1ll*SeqAt(i-S+1)*minu3+SeqAt(i+1))%mo3;
		if(ha1==g1 && ha2==g2 && ha3==g3)ans++;
	}
	PutInt(0,ans);
	Send(0);
	if(MyNodeId()==0){
		int ans=0;
		for (int i=0;i<NumberOfNodes();i++){
			Receive(i);
			int t=GetInt(i);
			ans+=t;
		}
		cout<<ans<<endl;
	}
	return 0;
}