#include <bits/stdc++.h> #include "message.h" #include "sabotaz.h" #define MP make_pair #define PB push_back #define st first #define nd second #define rd third #define FOR(i, a, b) for(int i =(a); i <=(b); ++i) #define RE(i, n) FOR(i, 1, n) #define FORD(i, a, b) for(int i = (a); i >= (b); --i) #define REP(i, n) for(int i = 0;i <(n); ++i) #define VAR(v, i) __typeof(i) v=(i) #define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #ifdef LOCAL #define debug(x) {cerr <<#x<<" = " <<x<<"\n"; } #define debug2(x, y) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<"\n";} #define debug3(x, y, z) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<", "<<#z<<" = "<<z<<"\n";} #define debug4(x, y, z, t) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<", "<<#z<<" = "<<z<<", "<<#t <<" = " <<t<<"\n";} #define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }} #else #define debug(x) #define debug2(x, y) #define debug3(x, y, z) #define debug4(x,y,z,t) #define debugv(x) #define cerr if(0)cout #endif #define make(type, x) type x; cin>>x; #define make2(type, x, y) type x, y; cin>>x>>y; #define make3(type, x, y, z) type x, y, z; cin>>x>>y>>z; #define make4(type, x, y, z, t) type x, y, z, t; cin>>x>>y>>z>>t; #define next ____next #define prev ____prev #define left ____left #define hash ____hash using namespace std; typedef long long ll; typedef long double LD; typedef pair<int, int> PII; typedef pair<ll, ll> PLL; typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<ll> VLL; typedef vector<pair<int, int> > VPII; typedef vector<pair<ll, ll> > VPLL; template<class C> void mini(C&a4, C b4){a4=min(a4, b4); } template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); } template<class T1, class T2> ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";} template<class A, class B, class C> struct Triple { A first; B second; C third; bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } }; template<class T> void ResizeVec(T&, vector<int>) {} template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) { vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; } for (T& v : vec) { ResizeVec(v, sz); } } typedef Triple<int, int, int> TIII; template<class A, class B, class C> ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; } const int kMaxNodes = 15; int NumNodes() { return min(kMaxNodes, NumberOfNodes()); } int BE(int i, int type) { if (type == 0) { return 1 + BridgeEndA(i - 1); } return 1 + BridgeEndB(i - 1); } const int I = 111; int bege[I], ende[I]; const int N = 2e5 + 5; const int kMaxIntInMsg = 50000; const int kMaxEdgesInMsg = 25000; int rep[N]; int Find(int v) { if (rep[v] == v) { return v; } rep[v] = Find(rep[v]); return rep[v]; } bool Union(int a, int b) { a = Find(a); b = Find(b); if (a == b) { return false; } rep[b] = a; return true; } int low[N]; int highh[N]; int cnt[N]; int d; VI slo[N]; vector<int> preorders, postorders, parents; void Dfs(int v, int lowuj) { d++; preorders[v] = d; for (auto nei : slo[v]) { if (preorders[nei]) { continue; } parents[nei] = v; Dfs(nei, lowuj); if (lowuj) { mini(low[v], low[nei]); maxi(highh[v], highh[nei]); } } d++; postorders[v] = d; } void SuperSend(int inst, vector<int>& vec) { int msg_num = (SZ(vec) + kMaxIntInMsg - 1) / kMaxIntInMsg; PutInt(inst, msg_num); Send(inst); REP (msg, msg_num) { PutInt(inst, min(kMaxIntInMsg, SZ(vec) - msg * kMaxIntInMsg)); for (int j = msg * kMaxIntInMsg; j < (msg + 1) * kMaxIntInMsg && j < SZ(vec); j++) { PutInt(inst, vec[j]); } Send(inst); } } vector<int> SuperReceive(int inst) { inst = Receive(inst); int parts = GetInt(inst); vector<int> vec; REP (i, parts) { Receive(inst); int sz = GetInt(inst); REP (j, sz) { vec.PB(GetInt(inst)); } } return vec; } int main() { if (MyNodeId() >= kMaxNodes) { return 0; } REP (i, NumNodes()) { bege[i] = 1ll * i * NumberOfBridges() / NumNodes() + 1; ende[i] = 1ll * (i + 1) * NumberOfBridges() / NumNodes(); } int n = NumberOfIsles(); RE (i, n) { rep[i] = i; } VI edges; int id = MyNodeId(); FOR (e, bege[id], ende[id]) { int a = BE(e, 0); int b = BE(e, 1); if (Union(a, b)) { edges.PB(e); } } preorders.resize(n + 5); postorders.resize(n + 5); parents.resize(n + 5); if (MyNodeId()) { SuperSend(0, edges); } else { RE (iii, NumNodes() - 1) { vector<int> edgess = SuperReceive(iii); for (auto e : edgess) { int a = BE(e, 0); int b = BE(e, 1); if (Union(a, b)) { edges.PB(e); } } } } if (id) { edges = SuperReceive((id - 1) / 2); } FOR (nxt, 2 * id + 1, 2 * id + 2) { if (nxt < NumNodes()) { SuperSend(nxt, edges); } } for (auto& e : edges) { int a = BE(e, 0); int b = BE(e, 1); slo[a].PB(b); slo[b].PB(a); } RE (i, n) { if (preorders[i]) { continue; } Dfs(i, 0); } RE (i, n) { low[i] = preorders[i]; highh[i] = postorders[i]; } FOR (i, bege[id], ende[id]) { int a = BE(i, 0); int b = BE(i, 1); if (preorders[a] < preorders[b]) { swap(a, b); } if (parents[a] == b) { cnt[a]++; } else { mini(low[a], preorders[b]); maxi(highh[b], postorders[a]); } } FOR (nxt, 2 * id + 1, 2 * id + 2) { if (nxt >= NumNodes()) { continue; } vector<int> cand_low = SuperReceive(nxt); vector<int> cand_high = SuperReceive(nxt); VI cand_cnt = SuperReceive(nxt); RE (i, n) { mini(low[i], cand_low[i]); maxi(highh[i], cand_high[i]); cnt[i] += cand_cnt[i]; } } if (id) { vector<int> send_low, send_high, send_cnt; send_low.PB(0); send_high.PB(0); send_cnt.PB(0); RE (i, n) { send_low.PB(low[i]); send_high.PB(highh[i]); send_cnt.PB(cnt[i]); } SuperSend((id - 1) / 2, send_low); SuperSend((id - 1) / 2, send_high); SuperSend((id - 1) / 2, send_cnt); } else { RE (i, n) { preorders[i] = 0; } d = 0; RE (i, n) { if (preorders[i]) { continue; } Dfs(i, 1); } // RE (i, n) { // if (i <= 20) { // debug3(i, preorders[i], postorders[i]); // debug3(low[i], highh[i], cnt[i]); // } // } int res = 0; FOR (i, 2, n) { if (low[i] == preorders[i] && highh[i] == postorders[i] && cnt[i] == 1) { res++; } } cout<<res<<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 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 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 | #include <bits/stdc++.h> #include "message.h" #include "sabotaz.h" #define MP make_pair #define PB push_back #define st first #define nd second #define rd third #define FOR(i, a, b) for(int i =(a); i <=(b); ++i) #define RE(i, n) FOR(i, 1, n) #define FORD(i, a, b) for(int i = (a); i >= (b); --i) #define REP(i, n) for(int i = 0;i <(n); ++i) #define VAR(v, i) __typeof(i) v=(i) #define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #ifdef LOCAL #define debug(x) {cerr <<#x<<" = " <<x<<"\n"; } #define debug2(x, y) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<"\n";} #define debug3(x, y, z) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<", "<<#z<<" = "<<z<<"\n";} #define debug4(x, y, z, t) {cerr <<#x<<" = " <<x<<", "<<#y <<" = " <<y <<", "<<#z<<" = "<<z<<", "<<#t <<" = " <<t<<"\n";} #define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }} #else #define debug(x) #define debug2(x, y) #define debug3(x, y, z) #define debug4(x,y,z,t) #define debugv(x) #define cerr if(0)cout #endif #define make(type, x) type x; cin>>x; #define make2(type, x, y) type x, y; cin>>x>>y; #define make3(type, x, y, z) type x, y, z; cin>>x>>y>>z; #define make4(type, x, y, z, t) type x, y, z, t; cin>>x>>y>>z>>t; #define next ____next #define prev ____prev #define left ____left #define hash ____hash using namespace std; typedef long long ll; typedef long double LD; typedef pair<int, int> PII; typedef pair<ll, ll> PLL; typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<ll> VLL; typedef vector<pair<int, int> > VPII; typedef vector<pair<ll, ll> > VPLL; template<class C> void mini(C&a4, C b4){a4=min(a4, b4); } template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); } template<class T1, class T2> ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";} template<class A, class B, class C> struct Triple { A first; B second; C third; bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } }; template<class T> void ResizeVec(T&, vector<int>) {} template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) { vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; } for (T& v : vec) { ResizeVec(v, sz); } } typedef Triple<int, int, int> TIII; template<class A, class B, class C> ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; } const int kMaxNodes = 15; int NumNodes() { return min(kMaxNodes, NumberOfNodes()); } int BE(int i, int type) { if (type == 0) { return 1 + BridgeEndA(i - 1); } return 1 + BridgeEndB(i - 1); } const int I = 111; int bege[I], ende[I]; const int N = 2e5 + 5; const int kMaxIntInMsg = 50000; const int kMaxEdgesInMsg = 25000; int rep[N]; int Find(int v) { if (rep[v] == v) { return v; } rep[v] = Find(rep[v]); return rep[v]; } bool Union(int a, int b) { a = Find(a); b = Find(b); if (a == b) { return false; } rep[b] = a; return true; } int low[N]; int highh[N]; int cnt[N]; int d; VI slo[N]; vector<int> preorders, postorders, parents; void Dfs(int v, int lowuj) { d++; preorders[v] = d; for (auto nei : slo[v]) { if (preorders[nei]) { continue; } parents[nei] = v; Dfs(nei, lowuj); if (lowuj) { mini(low[v], low[nei]); maxi(highh[v], highh[nei]); } } d++; postorders[v] = d; } void SuperSend(int inst, vector<int>& vec) { int msg_num = (SZ(vec) + kMaxIntInMsg - 1) / kMaxIntInMsg; PutInt(inst, msg_num); Send(inst); REP (msg, msg_num) { PutInt(inst, min(kMaxIntInMsg, SZ(vec) - msg * kMaxIntInMsg)); for (int j = msg * kMaxIntInMsg; j < (msg + 1) * kMaxIntInMsg && j < SZ(vec); j++) { PutInt(inst, vec[j]); } Send(inst); } } vector<int> SuperReceive(int inst) { inst = Receive(inst); int parts = GetInt(inst); vector<int> vec; REP (i, parts) { Receive(inst); int sz = GetInt(inst); REP (j, sz) { vec.PB(GetInt(inst)); } } return vec; } int main() { if (MyNodeId() >= kMaxNodes) { return 0; } REP (i, NumNodes()) { bege[i] = 1ll * i * NumberOfBridges() / NumNodes() + 1; ende[i] = 1ll * (i + 1) * NumberOfBridges() / NumNodes(); } int n = NumberOfIsles(); RE (i, n) { rep[i] = i; } VI edges; int id = MyNodeId(); FOR (e, bege[id], ende[id]) { int a = BE(e, 0); int b = BE(e, 1); if (Union(a, b)) { edges.PB(e); } } preorders.resize(n + 5); postorders.resize(n + 5); parents.resize(n + 5); if (MyNodeId()) { SuperSend(0, edges); } else { RE (iii, NumNodes() - 1) { vector<int> edgess = SuperReceive(iii); for (auto e : edgess) { int a = BE(e, 0); int b = BE(e, 1); if (Union(a, b)) { edges.PB(e); } } } } if (id) { edges = SuperReceive((id - 1) / 2); } FOR (nxt, 2 * id + 1, 2 * id + 2) { if (nxt < NumNodes()) { SuperSend(nxt, edges); } } for (auto& e : edges) { int a = BE(e, 0); int b = BE(e, 1); slo[a].PB(b); slo[b].PB(a); } RE (i, n) { if (preorders[i]) { continue; } Dfs(i, 0); } RE (i, n) { low[i] = preorders[i]; highh[i] = postorders[i]; } FOR (i, bege[id], ende[id]) { int a = BE(i, 0); int b = BE(i, 1); if (preorders[a] < preorders[b]) { swap(a, b); } if (parents[a] == b) { cnt[a]++; } else { mini(low[a], preorders[b]); maxi(highh[b], postorders[a]); } } FOR (nxt, 2 * id + 1, 2 * id + 2) { if (nxt >= NumNodes()) { continue; } vector<int> cand_low = SuperReceive(nxt); vector<int> cand_high = SuperReceive(nxt); VI cand_cnt = SuperReceive(nxt); RE (i, n) { mini(low[i], cand_low[i]); maxi(highh[i], cand_high[i]); cnt[i] += cand_cnt[i]; } } if (id) { vector<int> send_low, send_high, send_cnt; send_low.PB(0); send_high.PB(0); send_cnt.PB(0); RE (i, n) { send_low.PB(low[i]); send_high.PB(highh[i]); send_cnt.PB(cnt[i]); } SuperSend((id - 1) / 2, send_low); SuperSend((id - 1) / 2, send_high); SuperSend((id - 1) / 2, send_cnt); } else { RE (i, n) { preorders[i] = 0; } d = 0; RE (i, n) { if (preorders[i]) { continue; } Dfs(i, 1); } // RE (i, n) { // if (i <= 20) { // debug3(i, preorders[i], postorders[i]); // debug3(low[i], highh[i], cnt[i]); // } // } int res = 0; FOR (i, 2, n) { if (low[i] == preorders[i] && highh[i] == postorders[i] && cnt[i] == 1) { res++; } } cout<<res<<endl; } return 0; } |