\u3002\u3002\u7ed9\u5b9a\u4e00\u4e2a N \u4e2a\u9876\u70b9\u7684\u65e0\u5411\u56fe\uff08\u7a20\u5bc6\uff09\u3001\u56de\u7b54 Q \u6b21\u8be2\u95ee\u3002
\n\u95ee\u4e00\u6761\u8fb9\u7684\u6743\u503c\u589e\u52a0\u4e3a ci’ \u540e\uff0c\u65b0\u56fe\u7684 MST\u3002
\n(. .. N <= 3000, Q <= 10^6.. .) ..\n\n<\/p>\n
\u4e0b\u9762\u4ecb\u7ecd O(mlogm) \u7b97\u6cd5\u3001\u8bbe\u539f\u56fe\u7684\u6700\u5c0f\u751f\u6210\u6811\u4e3a T\uff0c\u82e5\u4fee\u6539\u4e00\u6761\u975e\u6811\u8fb9\u3001\u90a3\u4e48\u5bf9\u7ed3\u679c\u6ca1\u6709\u5f71\u54cd\uff08\u4fee\u6539\u64cd\u4f5c\u5355\u8c03\u9012\u589e\uff09.. .
\n\u5982\u679c\u662f\u6811\u8fb9\u3001\u90a3\u4e48\u8fd9\u6761\u8fb9\u53ef\u80fd\u4f1a\u56e0\u4e3a\u8fd9\u6b21\u4fee\u6539\u64cd\u4f5c\u800c\u88ab\u4e00\u6761\u975e\u6811\u8fb9\u66ff\u6362\u6389\u3001\u4e0d\u96be\u53d1\u73b0\u7528\u4ee5\u66ff\u6362\u7684\u8fb9\u662f\u552f\u4e00\u7684\u3002
\n\u4e8e\u662f\u5f97\u5230\u7b97\u6cd5\uff0c\u5bf9\u6bcf\u4e00\u6761\u975e\u6811\u8fb9\u3001\u677e\u5f1b\u751f\u6210\u6811\u4e0a\u8fd9\u4e24\u70b9\u4e4b\u95f4\u8def\u5f84\u7684\u6240\u6709\u6811\u8fb9\u3002<\/p>\n
\u5219\u5bf9\u4e8e\u6bcf\u4e00\u8be2\u95ee \uff08a, b, w’) .. .<\/p>\n
\r\n if (!\u6811\u8fb9) return mst;\r\n else return mst - w[a][b] + min(w', s[a][b]);\r\n<\/pre>\n\u5176\u4e2d s[a][b] \u662f\u55ef\u55ef\u55ef\u55ef\u55ef\u7684\u610f\u601d\u3002<\/p>\n
\uff08\u5982\u679c\u4f7f\u7528 Kruskal() \u7b97\u6cd5\u6c42\u89e3\u6700\u5c0f\u751f\u6210\u6811\u3002\u3002\u90a3\u4e48\u677e\u5f1b\u7684\u8fc7\u7a0b\u53ef\u4ee5\u7528\u5e76\u67e5\u96c6\u4f18\u5316\u5230 O(m) \u3002\u3002\u3002
\n\u6b21\u5c0f\u751f\u6210\u6811\u7684\u7b97\u6cd5\u6709\u5f88\u591a\uff0c\u5bf9\u4e8e\u8fd9\u9898\u3001\u4eca\u5e74\u5317\u4eac\u73b0\u573a\u8d5b\u533a Problem A \u7684\u7b97\u6cd5\u53ef\u80fd\u5e76\u4e0d\u9002\u7528\uff1f\u3002\u3002\uff09<\/p>\n\r\n\/** ` Micro Mezzo Macro Flation -- Overheated Economy ., **\/\r\n\r\n#include <algorithm>\r\n#include <iostream>\r\n#include <iomanip>\r\n#include <sstream>\r\n#include <cstring>\r\n#include <complex>\r\n#include <cstdio>\r\n#include <string>\r\n#include <vector>\r\n#include <bitset>\r\n#include <queue>\r\n#include <stack>\r\n#include <cmath>\r\n#include <ctime>\r\n#include <list>\r\n#include <set>\r\n#include <map>\r\n\r\nusing namespace std;\r\n\r\n#define REP(i, n) for (int i=0;i<int(n);++i)\r\n#define FOR(i, a, b) for (int i=int(a);i<int(b);++i)\r\n#define DWN(i, b, a) for (int i=int(b-1);i>=int(a);--i)\r\n#define REP_1(i, n) for (int i=1;i<=int(n);++i)\r\n#define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i)\r\n#define DWN_1(i, b, a) for (int i=int(b);i>=int(a);--i)\r\n#define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i)\r\n#define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i)\r\n#define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;--i)\r\n#define REP_N(i, n) for (i=0;i<int(n);++i)\r\n#define FOR_N(i, a, b) for (i=int(a);i<int(b);++i)\r\n#define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);--i)\r\n#define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i)\r\n#define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i)\r\n#define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;--i)\r\n#define REP_1_N(i, n) for (i=1;i<=int(n);++i)\r\n#define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i)\r\n#define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);--i)\r\n#define REP_C_N(i, n) for (n____=int(n),i=0;i<n____;++i)\r\n#define FOR_C_N(i, a, b) for (b____=int(b),i=a;i<b____;++i)\r\n#define DWN_C_N(i, b, a) for (a____=int(a),i=b-1;i>=a____;--i)\r\n#define REP_1_C_N(i, n) for (n____=int(n),i=1;i<=n____;++i)\r\n#define FOR_1_C_N(i, a, b) for (b____=int(b),i=a;i<=b____;++i)\r\n#define DWN_1_C_N(i, b, a) for (a____=int(a),i=b;i>=a____;--i)\r\n\r\n#define DO(n) while(n--)\r\n#define DO_C(n) int n____ = n; while(n____--)\r\n#define TO(i, a, b) int s_=a<b?1:-1,b_=b+s_;for(int i=a;i!=b_;i+=s_)\r\n#define TO_1(i, a, b) int s_=a<b?1:-1,b_=b;for(int i=a;i!=b_;i+=s_)\r\n#define SQZ(i, j, a, b) for (int i=int(a),j=int(b)-1;i<j;++i,--j)\r\n#define SQZ_1(i, j, a, b) for (int i=int(a),j=int(b);i<=j;++i,--j)\r\n#define REP_2(i, j, n, m) REP(i, n) REP(j, m)\r\n#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)\r\n\r\n#define ALL(A) A.begin(), A.end()\r\n#define LLA(A) A.rbegin(), A.rend()\r\n#define CPY(A, B) memcpy(A, B, sizeof(A))\r\n#define INS(A, P, B) A.insert(A.begin() + P, B)\r\n#define ERS(A, P) A.erase(A.begin() + P)\r\n#define BSC(A, X) find(ALL(A), X) \/\/ != A.end()\r\n#define CTN(T, x) (T.find(x) != T.end())\r\n#define SZ(A) int(A.size())\r\n#define PB push_back\r\n#define MP(A, B) make_pair(A, B)\r\n\r\n#define Rush int T____; RD(T____); DO(T____)\r\n#pragma comment(linker, "\/STACK:36777216")\r\n#pragma GCC optimize ("O2")\r\n#define Ruby system("ruby main.rb")\r\n#define Haskell system("runghc main.hs")\r\n#define Pascal system("fpc main.pas")\r\n\r\ntypedef long long LL;\r\ntypedef double DB;\r\ntypedef unsigned UINT;\r\ntypedef unsigned long long ULL;\r\n\r\ntypedef vector<int> VI;\r\ntypedef vector<char> VC;\r\ntypedef vector<string> VS;\r\ntypedef vector<LL> VL;\r\ntypedef vector<DB> VD;\r\ntypedef set<int> SI;\r\ntypedef set<string> SS;\r\ntypedef set<LL> SL;\r\ntypedef set<DB> SD;\r\ntypedef map<int, int> MII;\r\ntypedef map<string, int> MSI;\r\ntypedef map<LL, int> MLI;\r\ntypedef map<DB, int> MDI;\r\ntypedef map<int, bool> MIB;\r\ntypedef map<string, bool> MSB;\r\ntypedef map<LL, bool> MLB;\r\ntypedef map<DB, bool> MDB;\r\ntypedef pair<int, int> PII;\r\ntypedef pair<int, bool> PIB;\r\ntypedef vector<PII> VII;\r\ntypedef vector<VI> VVI;\r\ntypedef vector<VII> VVII;\r\ntypedef set<PII> SII;\r\ntypedef map<PII, int> MPIII;\r\ntypedef map<PII, bool> MPIIB;\r\n\r\n\r\n\/** I\/O Accelerator **\/\r\n\r\n\/* ... :" We are I\/O Accelerator ... Use us at your own risk ;) ... " .. *\/\r\n\r\ntemplate<class T> inline void RD(T &);\r\ntemplate<class T> inline void OT(const T &);\r\n\r\ninline int RD(){ int x; RD(x); return x;}\r\ntemplate<class T> inline T& _RD(T &x){ RD(x); return x;}\r\ninline void RC(char &c){scanf(" %c", &c);}\r\ninline void RS(char *s){scanf("%s", s);}\r\n\r\ntemplate<class T0, class T1> inline void RD(T0 &x0, T1 &x1){RD(x0), RD(x1);}\r\ntemplate<class T0, class T1, class T2> inline void RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5), RD(x6);}\r\ntemplate<class T0, class T1> inline void OT(T0 &x0, T1 &x1){OT(x0), OT(x1);}\r\ntemplate<class T0, class T1, class T2> inline void OT(T0 &x0, T1 &x1, T2 &x2){OT(x0), OT(x1), OT(x2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);}\r\n\r\ntemplate<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}\r\ntemplate<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);}\r\ntemplate<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3){RST(A0), RST(A1), RST(A2), RST(A3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5), RST(A6);}\r\n\r\ntemplate<class T> inline void CLR(T &A){A.clear();}\r\ntemplate<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);}\r\ntemplate<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3){CLR(A0), CLR(A1), CLR(A2), CLR(A3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5), CLR(A6);}\r\ntemplate<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);}\r\ntemplate<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));}\r\ntemplate<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);}\r\ntemplate<class T0, class T1, class T2> inline void FLC(T0 &A0, T1 &A1, T2 &A2){FLC(A0), FLC(A1), FLC(A2);}\r\ntemplate<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3){FLC(A0), FLC(A1), FLC(A2), FLC(A3);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5);}\r\ntemplate<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){FLC(A0), FLC(A1), FLC(A2), FLC(A3), FLC(A4), FLC(A5), FLC(A6);}\r\n\r\ntemplate<class T> inline void SRT(T &A){sort(ALL(A));}\r\ntemplate<class T, class C> inline void SRT(T &A, C B){sort(ALL(A), B);}\r\n\r\n\r\n\r\n\r\n\/** Add - On **\/\r\n\r\nconst int MOD = 1000000007;\r\nconst int INF = 0x7f7f7f7f;\r\nconst DB EPS = 1e-6;\r\nconst DB OO = 1e15;\r\nconst DB PI = acos(-1.0);\r\n\r\n\/\/ <<= ` 0. Daily Use .,\r\n\r\ntemplate<class T> inline void checkMin(T &a,const T b){if (b<a) a=b;}\r\ntemplate<class T> inline void checkMax(T &a,const T b){if (b>a) a=b;}\r\ntemplate <class T, class C> inline void checkMin(T& a, const T b, C c){if (c(b,a)) a = b;}\r\ntemplate <class T, class C> inline void checkMax(T& a, const T b, C c){if (c(a,b)) a = b;}\r\ntemplate<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}\r\ntemplate<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}\r\ntemplate<class T> inline T sqr(T a){return a*a;}\r\ntemplate<class T> inline T cub(T a){return a*a*a;}\r\nint Ceil(int x, int y){return (x - 1) \/ y + 1;}\r\n\r\n\/\/ <<= ` 1. Bitwise Operation .,\r\n\r\ninline bool _1(int x, int i){return x & 1<<i;}\r\ninline int _1(int i){return 1<<i;}\r\ninline int _U(int i){return _1(i) - 1;};\r\n\r\ninline int count_bits(int x){\r\n x = (x & 0x55555555) + ((x & 0xaaaaaaaa) >> 1);\r\n x = (x & 0x33333333) + ((x & 0xcccccccc) >> 2);\r\n x = (x & 0x0f0f0f0f) + ((x & 0xf0f0f0f0) >> 4);\r\n x = (x & 0x00ff00ff) + ((x & 0xff00ff00) >> 8);\r\n x = (x & 0x0000ffff) + ((x & 0xffff0000) >> 16);\r\n return x;\r\n}\r\n\r\ntemplate<class T> inline T low_bit(T x) {\r\n return x & -x;\r\n}\r\n\r\ntemplate<class T> inline T high_bit(T x) {\r\n T p = low_bit(x);\r\n while (p != x) x -= p, p = low_bit(x);\r\n return p;\r\n}\r\n\r\n\/\/ <<= ` 2. Modular Arithmetic Basic .,\r\n\r\ninline void INC(int &a, int b){a += b; if (a >= MOD) a -= MOD;}\r\ninline int sum(int a, int b){a += b; if (a >= MOD) a -= MOD; return a;}\r\ninline void DEC(int &a, int b){a -= b; if (a < 0) a += MOD;}\r\ninline int dff(int a, int b){a -= b; if (a < 0) a += MOD; return a;}\r\ninline void MUL(int &a, int b){a = int((LL)a * b % MOD);}\r\ninline int pdt(int a, int b){return int((LL)a * b % MOD);}\r\n\r\n\r\n\/\/ <<= ' 0. I\/O Accelerator interface .,\r\n\r\ntemplate<class T> inline void RD(T &x){\r\n \/\/cin >> x;\r\n \/\/scanf("%d", &x);\r\n char c; for (c = getchar(); c < '0'; c = getchar()); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';\r\n \/\/char c; c = getchar(); x = c - '0'; for (c = getchar(); c >= '0'; c = getchar()) x = x * 10 + c - '0';\r\n\r\n}\r\n\r\nint ____Case;\r\ntemplate<class T> inline void OT(const T &x){\r\n \/\/cout << x << endl;\r\n printf("%.4lf\\n", x);\r\n \/\/printf("%.2lf\\n", x);\r\n \/\/printf("Case %d: %d\\n", ++____Case, x);\r\n}\r\n\r\n\r\n#define For_each(it, A) for (SII::iterator it = A.begin(); it != A.end(); ++it)\r\n\r\n\/* .................................................................................................................................. *\/\r\n\r\nconst int N = 3009, M = N * N;\r\n\r\nint w[N][N], s[N][N]; bool InMst[N][N]; int P[N], R[N];\r\nPII E[M]; VI adj[N]; bool c[N]; int d[N]; int prd[N], vis[N], m, _i;\r\nint n, q, mst;\r\n\r\nvoid Make(int x){\r\n P[x] = x, R[x] = 0;\r\n}\r\n\r\nint Find(int x){\r\n if (P[x] != x) P[x] = Find(P[x]);\r\n return P[x];\r\n}\r\n\r\nvoid Union(int x, int y){\r\n if (R[x] < R[y]) P[y] = x;\r\n else {\r\n if (R[x] == R[y]) R[y]++;\r\n P[x] = y;\r\n }\r\n}\r\n\r\nvoid Prim1(){\r\n\r\n m = 0, RST(c), FLC(d, 0x7f), CPY(s, w), d[0] = 0;\r\n\r\n REP(i, n){\r\n int u = 0; while (c[u]) ++u; FOR(i, u+1, n) if (!c[i] && d[i] < d[u]) u = i;\r\n if (d[u]) s[prd[u]][u] = INF - 1, E[m++] = MP(prd[u], u); c[u] = true;\r\n REP(v, n) if (!c[v] && w[u][v] < d[v]) d[v] = w[u][v], prd[v] = u;\r\n }\r\n}\r\n\r\nvoid Prim2(){\r\n\r\n RST(c), FLC(d, 0x7f), d[0] = 0;\r\n\r\n REP(i, n){\r\n int u = 0; while(c[u]) ++u; FOR(i, u+1, n) if (!c[i] && d[i] < d[u]) u = i;\r\n if (d[u]) s[prd[u]][u] = INF - 1, E[m++] = MP(prd[u], u); c[u] = true;\r\n REP(v, n) if (!c[v] && s[u][v] < d[v]) d[v] = s[u][v], prd[v] = u;\r\n }\r\n\r\n}\r\n\r\n#define a first\r\n#define b second\r\n\r\nbool comp(PII x, PII y){\r\n return w[x.a][x.b] < w[y.a][y.b];\r\n}\r\n\r\nvoid Kruskal(){\r\n sort(E, E+m, comp); REP(i, n) Make(i); RST(InMst); mst = 0;\r\n\r\n REP(i, n) CLR(adj[i]);\r\n\r\n REP(i, m){\r\n if (Find(E[i].a) == Find(E[i].b)) continue; Union(Find(E[i].a), Find(E[i].b));\r\n InMst[E[i].a][E[i].b] = true, mst += w[E[i].a][E[i].b], adj[E[i].a].PB(E[i].b), adj[E[i].b].PB(E[i].a);\r\n }\r\n}\r\n\r\n#define v adj[u][i]\r\n\r\nvoid dfs(int u = 0, int p = -1){\r\n prd[u] = p; REP(i, SZ(adj[u])) if (v != p){\r\n dfs(v, u);\r\n }\r\n}\r\n\r\n#undef v\r\n\r\nint lca(int a, int b){\r\n while (a != 0){\r\n vis[a] = _i;\r\n a = prd[a];\r\n }\r\n\r\n vis[0] = _i;\r\n\r\n while (vis[b] != _i){\r\n b = prd[b];\r\n }\r\n\r\n return b;\r\n}\r\n\r\nvoid link(int a, int b, int c){\r\n\r\n int p = lca(a, b), t;\r\n\r\n#define Cloze(a, b) if (!s[a][b]) s[a][b] = s[b][a] = c\r\n\r\n while (a != p){\r\n Cloze(a, prd[a]);\r\n t = prd[a], prd[a] = p, a = t;\r\n }\r\n\r\n while (b != p){\r\n Cloze(b, prd[b]);\r\n t = prd[b], prd[b] = p, b = t;\r\n }\r\n}\r\n\r\nvoid Relax(){\r\n RST(vis, prd, s); dfs(); REP(i, m){\r\n if (InMst[E[i].a][E[i].b]) continue; _i = i + 1;\r\n link(E[i].a, E[i].b, w[E[i].a][E[i].b]);\r\n }\r\n\r\n REP(i, n) FOR(j, i+1, n) if (!s[i][j]) s[i][j] = INF;\r\n}\r\n\r\n#undef a\r\n#undef b\r\n\r\nint main(){\r\n\r\n \/\/freopen("in.txt", "r", stdin);\r\n\r\n while (scanf("%d %d", &n, &m) != EOF && n){\r\n\r\n int a, b; FLC(w, 0x7f); REP(i, m){\r\n RD(a, b); if (a > b) swap(a, b); RD(w[a][b]);\r\n }\r\n\r\n if (false && m > 2 * n) Prim1(), Prim2();\r\n else {m = 0; REP(i, n) FOR(j, i+1, n) if (w[a][b] != INF) E[m++] = MP(i, j);}\r\n\r\n Kruskal(); Relax();\r\n\r\n int sum = 0; int ww; DO_C(_RD(q)){\r\n RD(a, b, ww); if (a > b) swap(a, b);\r\n\r\n if (!InMst[a][b]) sum += mst;\r\n else sum += mst - w[a][b] + min(ww, s[a][b]);\r\n }\r\n\r\n OT(DB(sum) \/ q);\r\n }\r\n}\r\n<\/pre>\nFurther discussion: <\/h3>\n
\u6c42 O(n2) \u7b97\u6cd5\uff01\uff01\uff01<\/p>\n
External link: <\/h3>\n
http:\/\/acm.hdu.edu.cn\/showproblem.php?pid=4126<\/a>
\nhttp:\/\/www.cppblog.com\/MatoNo1\/archive\/2011\/11\/16\/149812.html<\/a>
\nhttps:\/\/www.shuizilong.com\/house\/wp-admin\/post.php?post=2498&action=edit&message=1<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"Brief description: \u3002\u3002\u7ed9\u5b9a\u4e00\u4e2a N \u4e2a\u9876\u70b9\u7684\u65e0\u5411\u56fe\uff08\u7a20\u5bc6\uff09\u3001\u56de\u7b54 Q \u6b21\u8be2\u95ee\u3002 \u95ee\u4e00\u6761\u8fb9\u7684\u6743\u503c\u589e\u52a0\u4e3a ci’ \u540e\uff0c\u65b0\u56fe\u7684 MST\u3002 (. .. N<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","enabled":false}}},"categories":[47],"tags":[50,49],"class_list":["post-144","post","type-post","status-publish","format-standard","hentry","category-hdu","tag-50","tag-49"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_shortlink":"https:\/\/wp.me\/p2tdP7-2k","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/144","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/comments?post=144"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/posts\/144\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/media?parent=144"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/categories?post=144"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/house\/wp-json\/wp\/v2\/tags?post=144"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}