#include <iostream> #include "poszukiwania.h" #include "message.h" long long seq_length; long long sig_lenght; size_t pos(size_t begin, size_t end) { size_t result = 0; int *t = new int[sig_lenght + 1]; t[0] = -1; for (size_t i = 1; i <= sig_lenght; i++) { int pos = t[i - 1]; while (pos != -1 && SignalAt(pos + 1) != SignalAt(i - 1 + 1)) { pos = t[pos]; } t[i] = pos + 1; } size_t sp = begin; size_t kp = 0; size_t safe_end = end + sig_lenght; if (safe_end > seq_length) { safe_end = seq_length; } while (sp < safe_end) { while (kp != -1 && (kp == sig_lenght || SignalAt(kp + 1) != SeqAt(sp + 1))) { kp = t[kp]; } kp++; sp++; if (sp - kp >= end) { break; } if (kp == sig_lenght) { ++result; } } return result; } void init() { size_t n = NumberOfNodes(); size_t len = seq_length / n; size_t begin = 0; for (size_t i = 1; i < n; ++i) { PutLL(i, begin); PutLL(i, begin += len); Send(i); } PutLL(0, begin); PutLL(0, seq_length); Send(0); } size_t master() { size_t result = 0; size_t n = NumberOfNodes(); for (size_t i = 0; i < n; ++i) { int source = Receive(-1); result += GetLL(source); } return result; } void slave() { int source = Receive(-1); size_t begin = GetLL(source); size_t end = GetLL(source); PutLL(source, pos(begin, end)); Send(source); } int main() { seq_length = SeqLength(); sig_lenght = SignalLength(); if (MyNodeId() == 0) { init(); } slave(); if (MyNodeId() == 0) { std::cout << master() << std::endl; } 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 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 | #include <iostream> #include "poszukiwania.h" #include "message.h" long long seq_length; long long sig_lenght; size_t pos(size_t begin, size_t end) { size_t result = 0; int *t = new int[sig_lenght + 1]; t[0] = -1; for (size_t i = 1; i <= sig_lenght; i++) { int pos = t[i - 1]; while (pos != -1 && SignalAt(pos + 1) != SignalAt(i - 1 + 1)) { pos = t[pos]; } t[i] = pos + 1; } size_t sp = begin; size_t kp = 0; size_t safe_end = end + sig_lenght; if (safe_end > seq_length) { safe_end = seq_length; } while (sp < safe_end) { while (kp != -1 && (kp == sig_lenght || SignalAt(kp + 1) != SeqAt(sp + 1))) { kp = t[kp]; } kp++; sp++; if (sp - kp >= end) { break; } if (kp == sig_lenght) { ++result; } } return result; } void init() { size_t n = NumberOfNodes(); size_t len = seq_length / n; size_t begin = 0; for (size_t i = 1; i < n; ++i) { PutLL(i, begin); PutLL(i, begin += len); Send(i); } PutLL(0, begin); PutLL(0, seq_length); Send(0); } size_t master() { size_t result = 0; size_t n = NumberOfNodes(); for (size_t i = 0; i < n; ++i) { int source = Receive(-1); result += GetLL(source); } return result; } void slave() { int source = Receive(-1); size_t begin = GetLL(source); size_t end = GetLL(source); PutLL(source, pos(begin, end)); Send(source); } int main() { seq_length = SeqLength(); sig_lenght = SignalLength(); if (MyNodeId() == 0) { init(); } slave(); if (MyNodeId() == 0) { std::cout << master() << std::endl; } return 0; } |