#include <cstdio> #include <iostream> #include <algorithm> #include <vector> #include <set> #include <map> using namespace std; typedef long long LL; typedef unsigned long long LLU; typedef vector<int> VI; typedef set<int> SI; typedef multiset<int> MSI; typedef pair<int, int> PII; typedef set<PII> SII; #define FOR(i,a,b) for (int i = a; i <= b; ++i) #define FORD(i,a,b) for (int i = a; i >= b; --i) #define REP(i,n) for (int i = 0; i < n; ++i) #define FORE(i,a) for(__typeof(a.begin()) i=a.begin();i!=a.end();++i) #define FORS(i,a) for(int i=0; i < (int)(a.size()); ++i) #define MP make_pair #define ST first #define ND second #define PB push_back #define DEBUG false #include "poszukiwania.h" #include "message.h" #define MAX_SIZE 64000 int nodes_nr2, my_nr, dl_fr_wz, ost_node, my_dl_fr_wz, N, M, my_off_wz, ile_maszyn; VI my_wyn; VI potw; VI pi; int myP(int i) { if (false) { printf("%d: my_dl = %d, my_off = %d, P(%d) = \n", my_nr, my_dl_fr_wz, my_off_wz, i); } return SignalAt(my_off_wz + i); } int T(int i) { return SeqAt(i); } void liczpi() { int m = my_dl_fr_wz; pi.PB(-1); pi.PB(0); int k = 0; for (int q = 2; q <= m; ++q) { while (k > 0 && myP(k + 1) != myP(q)) { k = pi[k]; } if (myP(k+1) == myP(q)) k = k + 1; pi.PB(k); } } void szukaj_wyn() { int m = my_dl_fr_wz; int q = 0; FOR(i, 1, N) { while (q > 0 && myP(q+1) != T(i)) q = pi[q]; if (myP(q+1) == T(i)) q = q + 1; if (q == m) { my_wyn.PB(i - m - my_off_wz); q = pi[q]; } } } void unknown(int sender, int type) { printf("Jestem %d. Nie umiem obsłużyć wiadomości %d dostanej od %d\n", my_nr, type, sender); } void dodaj_wyn(VI node_wyn) { FORE(val, node_wyn) { VI::iterator it = find(my_wyn.begin(), my_wyn.end(), *val); if (it != my_wyn.end()) { potw[it - my_wyn.begin()]++; } } } void send(VI v) { int size = v.size(); int paczek = (size + MAX_SIZE - 1) / MAX_SIZE; if (DEBUG) { printf("Sending from %d to 0, vect_size = %d, paczek = %d\n", my_nr, size, paczek); FORS(i, v) printf("%d ", v[i]); printf("\n"); } PutInt(0, paczek); Send(0); REP(i, paczek) { int ten_size = (i == paczek-1) ? size - (paczek-1) * MAX_SIZE : MAX_SIZE; if (DEBUG) { printf("ten_size = %d\n", ten_size); } PutInt(0, ten_size); for (int j = i * MAX_SIZE; j < i * MAX_SIZE + ten_size; j++) { PutInt(0, my_wyn[j]); if (DEBUG) { printf("%d ", my_wyn[j]); } } if (DEBUG) printf("\n"); Send(0); } } VI receive(int node) { int sender = Receive(node); int paczek = GetInt(sender); if (DEBUG) { printf("0 odbiera od %d %d paczek\n", node, paczek); } VI rec_wyn; while (paczek--) { Receive(sender); int ten_size = GetInt(sender); if (DEBUG) { printf("ten_size = %d\n", ten_size); } while (ten_size--) { int val = GetInt(sender); rec_wyn.PB(val); if (DEBUG) printf("%d ", val); } if (DEBUG) printf("\n"); } return rec_wyn; } int main() { N = SeqLength(); M = SignalLength(); nodes_nr2 = NumberOfNodes(); my_nr = MyNodeId(); dl_fr_wz = (M + nodes_nr2 - 1) / nodes_nr2; ile_maszyn = (M + dl_fr_wz - 1) / dl_fr_wz; ost_node = (my_nr == ile_maszyn - 1); my_dl_fr_wz = (ost_node ? M - ((ile_maszyn - 1) * dl_fr_wz) : dl_fr_wz); my_off_wz = my_nr * dl_fr_wz; if (my_nr >= ile_maszyn) return 0; // wszyscy // liczymy moje wyniki KMP liczpi(); szukaj_wyn(); // MASTER if (my_nr == 0) { if (DEBUG) { printf("Ile maszyn = %d, dl_fr_wz = %d\n", ile_maszyn, dl_fr_wz); printf("0: Moje wyniki (%d): ", (int) my_wyn.size()); FORS(i, my_wyn) printf("%d ", my_wyn[i]); printf("\n"); } FORS(i, my_wyn) { potw.PB(0); } FOR(node, 1, ile_maszyn - 1) { VI node_wyn = receive(node); if (DEBUG) { printf("Od %d dostałem %d: ", node, (int) node_wyn.size()); FORS(i, node_wyn) printf("%d ", node_wyn[i]); printf("\n"); } dodaj_wyn(node_wyn); } int wyn = 0; FORS(i, my_wyn) { if (DEBUG) printf("potw[%d] = %d\n", i, potw[i]); if (potw[i] == ile_maszyn - 1) { wyn++; } } printf("%d\n", wyn); } // ROBOTNIK else { send(my_wyn); } 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 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 | #include <cstdio> #include <iostream> #include <algorithm> #include <vector> #include <set> #include <map> using namespace std; typedef long long LL; typedef unsigned long long LLU; typedef vector<int> VI; typedef set<int> SI; typedef multiset<int> MSI; typedef pair<int, int> PII; typedef set<PII> SII; #define FOR(i,a,b) for (int i = a; i <= b; ++i) #define FORD(i,a,b) for (int i = a; i >= b; --i) #define REP(i,n) for (int i = 0; i < n; ++i) #define FORE(i,a) for(__typeof(a.begin()) i=a.begin();i!=a.end();++i) #define FORS(i,a) for(int i=0; i < (int)(a.size()); ++i) #define MP make_pair #define ST first #define ND second #define PB push_back #define DEBUG false #include "poszukiwania.h" #include "message.h" #define MAX_SIZE 64000 int nodes_nr2, my_nr, dl_fr_wz, ost_node, my_dl_fr_wz, N, M, my_off_wz, ile_maszyn; VI my_wyn; VI potw; VI pi; int myP(int i) { if (false) { printf("%d: my_dl = %d, my_off = %d, P(%d) = \n", my_nr, my_dl_fr_wz, my_off_wz, i); } return SignalAt(my_off_wz + i); } int T(int i) { return SeqAt(i); } void liczpi() { int m = my_dl_fr_wz; pi.PB(-1); pi.PB(0); int k = 0; for (int q = 2; q <= m; ++q) { while (k > 0 && myP(k + 1) != myP(q)) { k = pi[k]; } if (myP(k+1) == myP(q)) k = k + 1; pi.PB(k); } } void szukaj_wyn() { int m = my_dl_fr_wz; int q = 0; FOR(i, 1, N) { while (q > 0 && myP(q+1) != T(i)) q = pi[q]; if (myP(q+1) == T(i)) q = q + 1; if (q == m) { my_wyn.PB(i - m - my_off_wz); q = pi[q]; } } } void unknown(int sender, int type) { printf("Jestem %d. Nie umiem obsłużyć wiadomości %d dostanej od %d\n", my_nr, type, sender); } void dodaj_wyn(VI node_wyn) { FORE(val, node_wyn) { VI::iterator it = find(my_wyn.begin(), my_wyn.end(), *val); if (it != my_wyn.end()) { potw[it - my_wyn.begin()]++; } } } void send(VI v) { int size = v.size(); int paczek = (size + MAX_SIZE - 1) / MAX_SIZE; if (DEBUG) { printf("Sending from %d to 0, vect_size = %d, paczek = %d\n", my_nr, size, paczek); FORS(i, v) printf("%d ", v[i]); printf("\n"); } PutInt(0, paczek); Send(0); REP(i, paczek) { int ten_size = (i == paczek-1) ? size - (paczek-1) * MAX_SIZE : MAX_SIZE; if (DEBUG) { printf("ten_size = %d\n", ten_size); } PutInt(0, ten_size); for (int j = i * MAX_SIZE; j < i * MAX_SIZE + ten_size; j++) { PutInt(0, my_wyn[j]); if (DEBUG) { printf("%d ", my_wyn[j]); } } if (DEBUG) printf("\n"); Send(0); } } VI receive(int node) { int sender = Receive(node); int paczek = GetInt(sender); if (DEBUG) { printf("0 odbiera od %d %d paczek\n", node, paczek); } VI rec_wyn; while (paczek--) { Receive(sender); int ten_size = GetInt(sender); if (DEBUG) { printf("ten_size = %d\n", ten_size); } while (ten_size--) { int val = GetInt(sender); rec_wyn.PB(val); if (DEBUG) printf("%d ", val); } if (DEBUG) printf("\n"); } return rec_wyn; } int main() { N = SeqLength(); M = SignalLength(); nodes_nr2 = NumberOfNodes(); my_nr = MyNodeId(); dl_fr_wz = (M + nodes_nr2 - 1) / nodes_nr2; ile_maszyn = (M + dl_fr_wz - 1) / dl_fr_wz; ost_node = (my_nr == ile_maszyn - 1); my_dl_fr_wz = (ost_node ? M - ((ile_maszyn - 1) * dl_fr_wz) : dl_fr_wz); my_off_wz = my_nr * dl_fr_wz; if (my_nr >= ile_maszyn) return 0; // wszyscy // liczymy moje wyniki KMP liczpi(); szukaj_wyn(); // MASTER if (my_nr == 0) { if (DEBUG) { printf("Ile maszyn = %d, dl_fr_wz = %d\n", ile_maszyn, dl_fr_wz); printf("0: Moje wyniki (%d): ", (int) my_wyn.size()); FORS(i, my_wyn) printf("%d ", my_wyn[i]); printf("\n"); } FORS(i, my_wyn) { potw.PB(0); } FOR(node, 1, ile_maszyn - 1) { VI node_wyn = receive(node); if (DEBUG) { printf("Od %d dostałem %d: ", node, (int) node_wyn.size()); FORS(i, node_wyn) printf("%d ", node_wyn[i]); printf("\n"); } dodaj_wyn(node_wyn); } int wyn = 0; FORS(i, my_wyn) { if (DEBUG) printf("potw[%d] = %d\n", i, potw[i]); if (potw[i] == ile_maszyn - 1) { wyn++; } } printf("%d\n", wyn); } // ROBOTNIK else { send(my_wyn); } return 0; } |