#include "poszukiwania.h" #include "message.h" #include <vector> #include <iostream> using namespace std; int xxx = 100000; vector<long long> getNapis() { int non = NumberOfNodes() - 1; int intervalLength = 1 + SeqLength() - SignalLength(); int sublength = intervalLength / non; int begin, end; if (intervalLength % non != 0) sublength++; begin = (MyNodeId() - 1) * sublength + 1; end = MyNodeId() * sublength; if (end > intervalLength) end = intervalLength; end += SignalLength(); if (end > SeqLength() + 1) end = SeqLength() + 1; if (MyNodeId() == xxx) cout << "Begin end " << begin << " " << end << endl; if (end - begin < 0) return vector<long long>(0); //vector<long long> out(SeqLength()); vector<long long> out(end - begin); for (int i = begin; i < end; i++) out[i - begin] = SeqAt(i + 1); if (MyNodeId() == xxx) cout << "Ok" << endl; return out; } vector<long long> getWzorzec() { vector<long long> out(SignalLength()); for (int i = 0; i < out.size(); i++) out[i] = SignalAt(i + 1); return out; } int main() { ios_base::sync_with_stdio(0); if (MyNodeId() == 0) { long long out = 0; for (int instancja = 1; instancja < NumberOfNodes(); instancja++) { Receive(instancja); out += GetLL(instancja); } cout << out << endl; } else { long long out = 0; //TODO: Divide into chunks //P = Signal //T = Seq //szukamy s w m //s - signal //m - seq //wiec szukamy Signal w Seq //zatem P = Signal, T = Seq vector<long long> napis = getNapis(); vector<long long> wzorzec = getWzorzec(); long long m, i, k; vector<long long> T; // tablica częściowego dopasowania //for (i = 0; napis[i] != '\0'; i++) //if (napis.size() > 0 && wzorzec.size() > 0 && wzorzec.size() >= napis.size()) for (i = 0; i < napis.size(); i++) { if (napis[i] == wzorzec[0]) T.push_back(i); } //for (i = 0, k = 0, m = T[k]; m + i <= napis.length() && k < T.size(); i++) if (MyNodeId() == xxx) cout << "ts" << T.size() << endl; if (T.size() > 0) { for (i = 0, k = 0, m = T[k]; m + i < napis.size() && k < T.size(); i++) { //cout << i << endl; if (wzorzec[i] != napis[m + i]) { // nie pasuje m = T[++k]; i = 0; } if (i == wzorzec.size() - 1) { // pasuje //places.push_back(T[k]); //if (T[k] % 100 == 0) //cout << T[k] << endl; out++; m = T[++k]; i = 0; } } } if (MyNodeId() == xxx) cout << "Done." << endl; //cout << "Sending" << out << endl PutLL(0, out); Send(0); } 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 | #include "poszukiwania.h" #include "message.h" #include <vector> #include <iostream> using namespace std; int xxx = 100000; vector<long long> getNapis() { int non = NumberOfNodes() - 1; int intervalLength = 1 + SeqLength() - SignalLength(); int sublength = intervalLength / non; int begin, end; if (intervalLength % non != 0) sublength++; begin = (MyNodeId() - 1) * sublength + 1; end = MyNodeId() * sublength; if (end > intervalLength) end = intervalLength; end += SignalLength(); if (end > SeqLength() + 1) end = SeqLength() + 1; if (MyNodeId() == xxx) cout << "Begin end " << begin << " " << end << endl; if (end - begin < 0) return vector<long long>(0); //vector<long long> out(SeqLength()); vector<long long> out(end - begin); for (int i = begin; i < end; i++) out[i - begin] = SeqAt(i + 1); if (MyNodeId() == xxx) cout << "Ok" << endl; return out; } vector<long long> getWzorzec() { vector<long long> out(SignalLength()); for (int i = 0; i < out.size(); i++) out[i] = SignalAt(i + 1); return out; } int main() { ios_base::sync_with_stdio(0); if (MyNodeId() == 0) { long long out = 0; for (int instancja = 1; instancja < NumberOfNodes(); instancja++) { Receive(instancja); out += GetLL(instancja); } cout << out << endl; } else { long long out = 0; //TODO: Divide into chunks //P = Signal //T = Seq //szukamy s w m //s - signal //m - seq //wiec szukamy Signal w Seq //zatem P = Signal, T = Seq vector<long long> napis = getNapis(); vector<long long> wzorzec = getWzorzec(); long long m, i, k; vector<long long> T; // tablica częściowego dopasowania //for (i = 0; napis[i] != '\0'; i++) //if (napis.size() > 0 && wzorzec.size() > 0 && wzorzec.size() >= napis.size()) for (i = 0; i < napis.size(); i++) { if (napis[i] == wzorzec[0]) T.push_back(i); } //for (i = 0, k = 0, m = T[k]; m + i <= napis.length() && k < T.size(); i++) if (MyNodeId() == xxx) cout << "ts" << T.size() << endl; if (T.size() > 0) { for (i = 0, k = 0, m = T[k]; m + i < napis.size() && k < T.size(); i++) { //cout << i << endl; if (wzorzec[i] != napis[m + i]) { // nie pasuje m = T[++k]; i = 0; } if (i == wzorzec.size() - 1) { // pasuje //places.push_back(T[k]); //if (T[k] % 100 == 0) //cout << T[k] << endl; out++; m = T[++k]; i = 0; } } } if (MyNodeId() == xxx) cout << "Done." << endl; //cout << "Sending" << out << endl PutLL(0, out); Send(0); } return 0; } |