#include "message.h" #include "poszukiwania.h" //#include "pos-test/poszukiwania-test.h" #include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for (int i = (a); i <= (b); ++i) #define REPD(i,a,b) for (int i = (a); i >= (b); --i) #define FORI(i,n) REP(i,1,n) #define FOR(i,n) REP(i,0,int(n)-1) #define mp make_pair #define pb push_back #define pii pair<int,int> #define vi vector<int> #define ull long long #define SZ(x) int((x).size()) #define DBG(v) cerr << #v << " = " << (v) << endl; #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define fi first #define se second const ull QB = 1000035733LL; const ull QA = 1000035689LL; //const ull PA = 1000000007LL; //const ull PB = 1000000013LL; ull PA=10, PB=10; int NODES, ID; int S,M; ull qpow(ull a, int n, ull p) { if (n==0) return 1; ull b = qpow(a,n/2,p); b = b*b%p; if (n&1) b=b*a%p; return b; } ull haszujsig(int first, int last) { ull retA = 0, retB = 0; REP(i,first,last-1) { long long cur = SignalAt(i+1); retA = (retA*PA + cur) % QA; retB = (retB*PB + cur) % QB; } return retA*QB+retB; } ull haszujseq(int first, int last) { ull retA = 0, retB = 0; REP(i,first,last-1) { long long cur = SeqAt(i+1); retA = (retA*PA + cur) % QA; retB = (retB*PB + cur) % QB; } return retA*QB+retB; } ull ha[111]; ull seq0a[111], seq1a[111]; ull hb[111]; ull seq0b[111], seq1b[111]; int main () { NODES = NumberOfNodes(); ID = MyNodeId(); // liczymy hasze sygnalu S = SignalLength(); M = SeqLength(); int len = (S+NODES-1)/NODES; int first = min(len*ID, S); int last = min(first+len, S); // przekazujemy hasze ull hasz = haszujsig(first, last); //printf("mam hasza %llu z przedzialu %d %d\n", hasz/QB, first, last); FOR(i,NODES) { PutLL(i, hasz); Send(i); } // zbieramy hasze FOR(i,NODES) { Receive(i); ull temph = GetLL(i); ha[i] = temph / QB; hb[i] = temph % QB; } //FOR(i,NODES) printf("%llu ", ha[i]); printf("\n"); // robimy calego hasza ull HA = 0, HB = 0; FOR(i,NODES) { int F = min(len*i,S), L = min(F+len,S); HA = (HA * qpow(PA, L-F, QA) + ha[i]) % QA; HB = (HB * qpow(PB, L-F, QB) + hb[i]) % QB; } //if (ID==0) printf("hasz=%llu %llu\n", HA, HB); // liczymy hasze ciagu int ml = (M+NODES-1)/NODES; first = min(ml*ID,M); last = min(first+ml,M); ull h0, h1; int mid = first+S%ml; if (mid <= last) { h1 = haszujseq(first, mid); h0 = haszujseq(mid, last); ull h1a = h1/QB, h1b = h1%QB; ull h0a = h0/QB, h0b = h0%QB; h0a = (h1a * qpow(PA, last-mid, QA) + h0a) % QA; h0b = (h1b * qpow(PB, last-mid, QB) + h0b) % QB; h0 = h0a * QB + h0b; } else { h0 = haszujseq(first, last); } // wysylamy FOR(i,NODES) { PutLL(i, h0); if (mid <= last) PutLL(i, h1); else PutLL(i, 0LL); Send(i); } // odbieramy FOR(i,NODES) { Receive(i); ull seq0 = GetLL(i); // hasz przedzialu ull seq1 = GetLL(i); // hasz az do S%ml seq0a[i] = seq0 / QB; seq0b[i] = seq0 % QB; seq1a[i] = seq1 / QB; seq1b[i] = seq1 % QB; } /* if (ID==0) { printf("S=%d, M=%d, ml=%d\n", S, M, ml); printf("hasze to: "); FOR(i, NODES) printf("%llu ", seq0a[i]); printf("\n"); printf("polowki to: "); FOR(i, NODES) printf("%llu ", seq1a[i]); printf("\n"); }*/ // hasz srodka int left = first, right = left + S; if (right > M) { PutInt(0,0); Send(0); // TODO wyslij ze 0 return 0; } int rbase = right / ml; // lbase = ID ull SHA = 0, SHB = 0; // hasz [ID*ml..ID*ml+S] ull MPWA = qpow(PA,ml,QA), MPWB = qpow(PB,ml,QB); REP(i,ID,rbase-1) { SHA = (SHA * MPWA + seq0a[i]) % QA; SHB = (SHB * MPWB + seq0b[i]) % QB; } SHA = (SHA * qpow(PA, S%ml, QA) + seq1a[rbase]) % QA; SHB = (SHB * qpow(PB, S%ml, QB) + seq1b[rbase]) % QB; //printf("srodek to %llu -- %d do %d i potem %d bo ml=%d\n", SHA, left, rbase*ml, S%ml, ml); int res = 0; //printf("HA=%llu, HB=%llu, SHA=%llu, SHB=%llu\n", HA,HB,SHA,SHB); if (HA==SHA && HB==SHB) res++; ull PWA = qpow(PA, S-1, QA); ull PWB = qpow(PB, S-1, QB); //printf("zbieram %d %d\n", first, last); FOR(i,ml-1) { if (first+i+S >= M) break; long long f0 = SeqAt(first+i+1), f1 = SeqAt(first+S+i+1); SHA -= PWA * f0 % QA; if (SHA < 0) SHA += QA; SHA = (SHA*PA + f1) % QA; SHB -= PWB * f0 % QB; if (SHB < 0) SHB += QB; SHB = (SHB*PB + f1) % QB; //printf("i=%d, SH = %llu\n", i, SH); if (HA==SHA && HB==SHB) res++; } PutInt(0, res); Send(0); if (ID==0) { int result = 0; FOR(i,NODES) { Receive(i); result += GetInt(i); } printf("%d\n", result); } }
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 | #include "message.h" #include "poszukiwania.h" //#include "pos-test/poszukiwania-test.h" #include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for (int i = (a); i <= (b); ++i) #define REPD(i,a,b) for (int i = (a); i >= (b); --i) #define FORI(i,n) REP(i,1,n) #define FOR(i,n) REP(i,0,int(n)-1) #define mp make_pair #define pb push_back #define pii pair<int,int> #define vi vector<int> #define ull long long #define SZ(x) int((x).size()) #define DBG(v) cerr << #v << " = " << (v) << endl; #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define fi first #define se second const ull QB = 1000035733LL; const ull QA = 1000035689LL; //const ull PA = 1000000007LL; //const ull PB = 1000000013LL; ull PA=10, PB=10; int NODES, ID; int S,M; ull qpow(ull a, int n, ull p) { if (n==0) return 1; ull b = qpow(a,n/2,p); b = b*b%p; if (n&1) b=b*a%p; return b; } ull haszujsig(int first, int last) { ull retA = 0, retB = 0; REP(i,first,last-1) { long long cur = SignalAt(i+1); retA = (retA*PA + cur) % QA; retB = (retB*PB + cur) % QB; } return retA*QB+retB; } ull haszujseq(int first, int last) { ull retA = 0, retB = 0; REP(i,first,last-1) { long long cur = SeqAt(i+1); retA = (retA*PA + cur) % QA; retB = (retB*PB + cur) % QB; } return retA*QB+retB; } ull ha[111]; ull seq0a[111], seq1a[111]; ull hb[111]; ull seq0b[111], seq1b[111]; int main () { NODES = NumberOfNodes(); ID = MyNodeId(); // liczymy hasze sygnalu S = SignalLength(); M = SeqLength(); int len = (S+NODES-1)/NODES; int first = min(len*ID, S); int last = min(first+len, S); // przekazujemy hasze ull hasz = haszujsig(first, last); //printf("mam hasza %llu z przedzialu %d %d\n", hasz/QB, first, last); FOR(i,NODES) { PutLL(i, hasz); Send(i); } // zbieramy hasze FOR(i,NODES) { Receive(i); ull temph = GetLL(i); ha[i] = temph / QB; hb[i] = temph % QB; } //FOR(i,NODES) printf("%llu ", ha[i]); printf("\n"); // robimy calego hasza ull HA = 0, HB = 0; FOR(i,NODES) { int F = min(len*i,S), L = min(F+len,S); HA = (HA * qpow(PA, L-F, QA) + ha[i]) % QA; HB = (HB * qpow(PB, L-F, QB) + hb[i]) % QB; } //if (ID==0) printf("hasz=%llu %llu\n", HA, HB); // liczymy hasze ciagu int ml = (M+NODES-1)/NODES; first = min(ml*ID,M); last = min(first+ml,M); ull h0, h1; int mid = first+S%ml; if (mid <= last) { h1 = haszujseq(first, mid); h0 = haszujseq(mid, last); ull h1a = h1/QB, h1b = h1%QB; ull h0a = h0/QB, h0b = h0%QB; h0a = (h1a * qpow(PA, last-mid, QA) + h0a) % QA; h0b = (h1b * qpow(PB, last-mid, QB) + h0b) % QB; h0 = h0a * QB + h0b; } else { h0 = haszujseq(first, last); } // wysylamy FOR(i,NODES) { PutLL(i, h0); if (mid <= last) PutLL(i, h1); else PutLL(i, 0LL); Send(i); } // odbieramy FOR(i,NODES) { Receive(i); ull seq0 = GetLL(i); // hasz przedzialu ull seq1 = GetLL(i); // hasz az do S%ml seq0a[i] = seq0 / QB; seq0b[i] = seq0 % QB; seq1a[i] = seq1 / QB; seq1b[i] = seq1 % QB; } /* if (ID==0) { printf("S=%d, M=%d, ml=%d\n", S, M, ml); printf("hasze to: "); FOR(i, NODES) printf("%llu ", seq0a[i]); printf("\n"); printf("polowki to: "); FOR(i, NODES) printf("%llu ", seq1a[i]); printf("\n"); }*/ // hasz srodka int left = first, right = left + S; if (right > M) { PutInt(0,0); Send(0); // TODO wyslij ze 0 return 0; } int rbase = right / ml; // lbase = ID ull SHA = 0, SHB = 0; // hasz [ID*ml..ID*ml+S] ull MPWA = qpow(PA,ml,QA), MPWB = qpow(PB,ml,QB); REP(i,ID,rbase-1) { SHA = (SHA * MPWA + seq0a[i]) % QA; SHB = (SHB * MPWB + seq0b[i]) % QB; } SHA = (SHA * qpow(PA, S%ml, QA) + seq1a[rbase]) % QA; SHB = (SHB * qpow(PB, S%ml, QB) + seq1b[rbase]) % QB; //printf("srodek to %llu -- %d do %d i potem %d bo ml=%d\n", SHA, left, rbase*ml, S%ml, ml); int res = 0; //printf("HA=%llu, HB=%llu, SHA=%llu, SHB=%llu\n", HA,HB,SHA,SHB); if (HA==SHA && HB==SHB) res++; ull PWA = qpow(PA, S-1, QA); ull PWB = qpow(PB, S-1, QB); //printf("zbieram %d %d\n", first, last); FOR(i,ml-1) { if (first+i+S >= M) break; long long f0 = SeqAt(first+i+1), f1 = SeqAt(first+S+i+1); SHA -= PWA * f0 % QA; if (SHA < 0) SHA += QA; SHA = (SHA*PA + f1) % QA; SHB -= PWB * f0 % QB; if (SHB < 0) SHB += QB; SHB = (SHB*PB + f1) % QB; //printf("i=%d, SH = %llu\n", i, SH); if (HA==SHA && HB==SHB) res++; } PutInt(0, res); Send(0); if (ID==0) { int result = 0; FOR(i,NODES) { Receive(i); result += GetInt(i); } printf("%d\n", result); } } |