#include <cstdio> #include <cstdlib> #include <iostream> #include <vector> #include "poszukiwania.h" #include "message.h" using namespace std; vector <long long int> fpi(long long int sf) { vector <long long int> pref(1, 0); int k=0; for(long long int i=1;i<sf;i++) { while(k>0 && SignalAt(k+1)!=SignalAt(i+1)) k=pref[k-1]; if(SignalAt(k+1)==SignalAt(i+1)) k++; pref.push_back(k); } return pref; } long long int kmp(long long int sf, long long int mf, long long int partf) { long long int z=0LL, k=0LL; vector <long long int> pref=fpi(sf); for(long long int i=MyNodeId()*partf;i<min(mf, (MyNodeId()+1)*partf+sf-1);i++) { while(k>0 && SignalAt(k+1)!=SeqAt(i+1)) k=pref[k-1]; if(SignalAt(k+1)==SeqAt(i+1)) k++; if(k==sf) { z++; k=pref[k-1]; } } return z; } int main() { long long int s, m, x, licz, linst, part; s=SignalLength(); m=SeqLength(); linst=NumberOfNodes(); part=m%linst==0?m/linst:m/linst+1; licz=kmp(s, m, part); if(MyNodeId()>0) { PutLL(0, licz); Send(0); } else { for(long long int i=1;i<linst;i++) { Receive(i); licz=licz+GetLL(i); } printf("%lld\n", licz); } return 0; }
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 | #include <cstdio> #include <cstdlib> #include <iostream> #include <vector> #include "poszukiwania.h" #include "message.h" using namespace std; vector <long long int> fpi(long long int sf) { vector <long long int> pref(1, 0); int k=0; for(long long int i=1;i<sf;i++) { while(k>0 && SignalAt(k+1)!=SignalAt(i+1)) k=pref[k-1]; if(SignalAt(k+1)==SignalAt(i+1)) k++; pref.push_back(k); } return pref; } long long int kmp(long long int sf, long long int mf, long long int partf) { long long int z=0LL, k=0LL; vector <long long int> pref=fpi(sf); for(long long int i=MyNodeId()*partf;i<min(mf, (MyNodeId()+1)*partf+sf-1);i++) { while(k>0 && SignalAt(k+1)!=SeqAt(i+1)) k=pref[k-1]; if(SignalAt(k+1)==SeqAt(i+1)) k++; if(k==sf) { z++; k=pref[k-1]; } } return z; } int main() { long long int s, m, x, licz, linst, part; s=SignalLength(); m=SeqLength(); linst=NumberOfNodes(); part=m%linst==0?m/linst:m/linst+1; licz=kmp(s, m, part); if(MyNodeId()>0) { PutLL(0, licz); Send(0); } else { for(long long int i=1;i<linst;i++) { Receive(i); licz=licz+GetLL(i); } printf("%lld\n", licz); } return 0; } |