#include "sabotaz.h" #include "message.h" #include<bits/stdc++.h> using namespace std; typedef pair<int,int> PI; typedef long long LL; typedef double D; #define FI first #define SE second #define MP make_pair #define PB push_back #define R(I,N) for(int I=0;I<N;I++) #define F(I,A,B) for(int I=A;I<B;I++) #define FD(I,N) for(int I=N-1;I>=0;I--) #define make(A) scanf("%d",&A) #define make2(A,B) scanf("%d%d",&A,&B) #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define db if(1)printf template<typename C> void MA(C& a,C b){if(a<b)a=b;} template<typename C> void MI(C& a,C b){if(a>b)a=b;} #define MAX 200010 int proc,id; int n; vector<int> d[MAX]; int low[MAX]; bool cz[MAX]; int most[MAX]; int oj[MAX]; int po[MAX]; vector<PI> wyn; void clr(){ R(i,n){ cz[i] = 0; most[i] = -1; } wyn.clear(); } bool czy_most(int a,int b){ return most[a] == b || most[b] == a; } void liczmosty(bool ost = 0){ clr(); R(st,n){ if(cz[st])continue; stack<int> stos; vector<int> stos2; oj[st] = -1; int ipo = 0; stos.push(st); while(!stos.empty()){ int nr = stos.top(); stos.pop(); if(cz[nr])continue; cz[nr] = 1; stos2.PB(nr); po[nr] = ipo; low[nr] = ipo; ipo++; for(int ak : d[nr]){ if(cz[ak] == 0){ oj[ak] = nr; stos.push(ak); } } } FD(i,SZ(stos2)){ int nr = stos2[i]; int il = 0; for(int ak : d[nr]){ if(ak != oj[nr]){ MI(low[nr],low[ak]); }else il++; } if(il>1)MI(low[nr],low[oj[nr]]); if(low[nr] == po[nr] && oj[nr] != -1){ most[nr] = oj[nr]; wyn.PB({nr,oj[nr]}); } } } if(ost){ int res = 0; R(i,n){ if(most[i] != -1) res ++; } printf("%d\n",res); return; } R(i,n)cz[i] = 0; R(i,n)if(cz[i] == 0){ cz[i] = 1; vector<int> ss; ss.PB(i); R(j,SZ(ss)){ int nr = ss[j]; for(int ak:d[nr]){ if(cz[ak] == 0 && !czy_most(nr,ak)){ cz[ak] = 1; ss.PB(ak); } } } if(SZ(ss) > 1){ ss.PB(ss[0]); R(i,SZ(ss)-1) wyn.PB({ss[i],ss[i+1]}); } } R(i,n)d[i].clear(); } void pobierz(int p,int k){ F(i,p,k){ int a = BridgeEndA(i); int b = BridgeEndB(i); if(a!=b){ d[a].PB(b); d[b].PB(a); } } } main(){ proc = NumberOfNodes(); id = MyNodeId(); n = NumberOfIsles(); int m = NumberOfBridges(); int il = (m+proc-1)/proc; pobierz(min(il*id,m), min(il*(id+1),m)); int krok = 1; while(krok < proc){ liczmosty(); if(id & krok){ PutInt(id - krok, SZ(wyn)); R(i,SZ(wyn)){ if((i & ((1<<15)-1)) == (3<<13))Send(id - krok); PutInt(id - krok, wyn[i].FI); PutInt(id - krok, wyn[i].SE); } Send(id - krok); return 0; }else{ R(i,SZ(wyn)){ d[wyn[i].FI].PB(wyn[i].SE); d[wyn[i].SE].PB(wyn[i].FI); } if(id + krok < proc){ Receive(id + krok); int il = GetInt(id + krok); R(i,il){ if((i & ((1<<15)-1)) == (3<<13))Receive(id + krok); int a,b; a = GetInt(id + krok); b = GetInt(id + krok); d[a].PB(b); d[b].PB(a); } } } krok*=2; } liczmosty(1); }
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 | #include "sabotaz.h" #include "message.h" #include<bits/stdc++.h> using namespace std; typedef pair<int,int> PI; typedef long long LL; typedef double D; #define FI first #define SE second #define MP make_pair #define PB push_back #define R(I,N) for(int I=0;I<N;I++) #define F(I,A,B) for(int I=A;I<B;I++) #define FD(I,N) for(int I=N-1;I>=0;I--) #define make(A) scanf("%d",&A) #define make2(A,B) scanf("%d%d",&A,&B) #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define db if(1)printf template<typename C> void MA(C& a,C b){if(a<b)a=b;} template<typename C> void MI(C& a,C b){if(a>b)a=b;} #define MAX 200010 int proc,id; int n; vector<int> d[MAX]; int low[MAX]; bool cz[MAX]; int most[MAX]; int oj[MAX]; int po[MAX]; vector<PI> wyn; void clr(){ R(i,n){ cz[i] = 0; most[i] = -1; } wyn.clear(); } bool czy_most(int a,int b){ return most[a] == b || most[b] == a; } void liczmosty(bool ost = 0){ clr(); R(st,n){ if(cz[st])continue; stack<int> stos; vector<int> stos2; oj[st] = -1; int ipo = 0; stos.push(st); while(!stos.empty()){ int nr = stos.top(); stos.pop(); if(cz[nr])continue; cz[nr] = 1; stos2.PB(nr); po[nr] = ipo; low[nr] = ipo; ipo++; for(int ak : d[nr]){ if(cz[ak] == 0){ oj[ak] = nr; stos.push(ak); } } } FD(i,SZ(stos2)){ int nr = stos2[i]; int il = 0; for(int ak : d[nr]){ if(ak != oj[nr]){ MI(low[nr],low[ak]); }else il++; } if(il>1)MI(low[nr],low[oj[nr]]); if(low[nr] == po[nr] && oj[nr] != -1){ most[nr] = oj[nr]; wyn.PB({nr,oj[nr]}); } } } if(ost){ int res = 0; R(i,n){ if(most[i] != -1) res ++; } printf("%d\n",res); return; } R(i,n)cz[i] = 0; R(i,n)if(cz[i] == 0){ cz[i] = 1; vector<int> ss; ss.PB(i); R(j,SZ(ss)){ int nr = ss[j]; for(int ak:d[nr]){ if(cz[ak] == 0 && !czy_most(nr,ak)){ cz[ak] = 1; ss.PB(ak); } } } if(SZ(ss) > 1){ ss.PB(ss[0]); R(i,SZ(ss)-1) wyn.PB({ss[i],ss[i+1]}); } } R(i,n)d[i].clear(); } void pobierz(int p,int k){ F(i,p,k){ int a = BridgeEndA(i); int b = BridgeEndB(i); if(a!=b){ d[a].PB(b); d[b].PB(a); } } } main(){ proc = NumberOfNodes(); id = MyNodeId(); n = NumberOfIsles(); int m = NumberOfBridges(); int il = (m+proc-1)/proc; pobierz(min(il*id,m), min(il*(id+1),m)); int krok = 1; while(krok < proc){ liczmosty(); if(id & krok){ PutInt(id - krok, SZ(wyn)); R(i,SZ(wyn)){ if((i & ((1<<15)-1)) == (3<<13))Send(id - krok); PutInt(id - krok, wyn[i].FI); PutInt(id - krok, wyn[i].SE); } Send(id - krok); return 0; }else{ R(i,SZ(wyn)){ d[wyn[i].FI].PB(wyn[i].SE); d[wyn[i].SE].PB(wyn[i].FI); } if(id + krok < proc){ Receive(id + krok); int il = GetInt(id + krok); R(i,il){ if((i & ((1<<15)-1)) == (3<<13))Receive(id + krok); int a,b; a = GetInt(id + krok); b = GetInt(id + krok); d[a].PB(b); d[b].PB(a); } } } krok*=2; } liczmosty(1); } |