n\u4e2a\u70b9\uff0cm\u6761\u8def\u5f84\uff0cd\u6b21\u8be2\u95ee\uff0c\u6bcf\u6b21\u9501\u5b9a\u4e00\u4e2a\u70b9c,\u7ed9\u51faq\u6761\u8fb9\uff0c\u95ee\uff0cq\u6761\u8fb9\u5728\u9501\u5b9ac\u70b9\u540e\u591a\u5c11\u6761\u8fb9\u65e0\u6cd5\u8fde\u901a<\/p>\n
\u5e76\u67e5\u96c6\u652f\u6301\u52a0\u4e00\u4e9b\u70b9\u8fdb\u53bb\u6765\u5224\u65ad\u662f\u4e0d\u662f\u5728\u4e00\u4e2a\u96c6\u5408\uff0c\u4f46\u662f\u5982\u679c\u5220\u53bb\u4e00\u4e2a\u70b9\u5c31\u4e0d\u77e5\u9053\u591a\u5c11\u4e2a\u70b9\u4f1a\u53d7\u5f71\u54cd\uff0c\u6240\u4ee5\uff0c\u8fd9\u9053\u9898\u7684\u7cbe\u534e\u5c31\u662f\u5012\u8fc7\u6765\uff0c\u5148\u5c06\u90a3\u4e9b\u4ece\u6765\u6ca1\u6709\u9501\u5b9a\u7684\u70b9\u6784\u5efa\u5e76\u67e5\u96c6\uff0c\u7136\u540e\u5012\u8fc7\u6765\u5904\u7406\uff0c\u6bcf\u6b21\u91ca\u653e\u4e00\u4e2a\u70b9\uff0c\u5e76\u67e5\u96c6\u7ef4\u62a4\u6ca1\u6709\u9501\u5b9a\u70b9\u7684\u96c6\u5408\u3002<\/p>\n
\u4ee3\u7801<\/h2>\n#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#define x first\n#define y second\n#define endl '\\n'\n#define IOS \\\n ios_base::sync_with_stdio(0); \\\n cin.tie(0); \\\n cout.tie(0);\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> pll;\ntypedef pair<int, int> pii;\ntypedef unsigned long long ull;\n\nconst int INF = 0x3f3f3f3f, mod = 1000000007;\nconst int N = 2e5 + 10;\n\nint n, m, d;\nint day[N], p[N];\nvector<int> a[N];\nvector<pii> v[N];\nmap<int, int> vis;\n\nint find(int x)\n{\n if (x != p[x])\n p[x] = find(p[x]);\n return p[x];\n}\n\nvoid solve()\n{\n cin >> n >> m >> d;\n for (int i = 1; i <= n; i++) {\n p[i] = i;\n }\n for (int i = 1; i <= m; i++) {\n int x, y;\n cin >> x >> y;\n a[x].push_back(y);\n a[y].push_back(x);\n }\n for (int i = 1; i <= d; i++) {\n int c, q;\n cin >> c >> q;\n day[i] = c;\n vis[c] = 1;\n while (q--) {\n int x, y;\n cin >> x >> y;\n v[i].push_back({x, y});\n }\n }\n\n for(int i = 1; i <= n; i++){\n if(vis[i]) continue;\n for(auto x : a[i]){\n if(vis[x]) continue;\n int fx = find(x), fy = find(i);\n if(fx != fy) p[fx] = fy;\n }\n }\n\n stack<int> q;\n for (int i = d; i; i--) {\n int cnt = 0, c = day[i];\n for(auto x : v[i]){\n int fx = find(x.x), fy = find(x.y);\n if(fx != fy) cnt++;\n }\n q.push(cnt);\n\n for(auto x : a[c]){\n if(vis[x]) continue;\n int fx = find(x), fy = find(c);\n if(fx != fy) p[fx] = fy;\n }\n vis[c] = 0;\n\n }\n while (q.size()) {\n cout << q.top() << endl;\n q.pop();\n }\n}\nint main()\n{\n \/\/ IOS;\n int _ = 1;\n \/\/ cin >> _;\n while (_--) {\n solve();\n }\n return 0;\n}<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"\u9898\u76ee\u94fe\u63a5 \u94fe\u63a5 \u9898\u76ee\u5927\u610f n\u4e2a\u70b9\uff0cm\u6761\u8def\u5f84\uff0cd\u6b21\u8be2\u95ee\uff0c\u6bcf\u6b21\u9501\u5b9a\u4e00\u4e2a\u70b9c,\u7ed9\u51faq\u6761\u8fb9\uff0c\u95ee\uff0cq\u6761\u8fb9\u5728\u9501\u5b9ac\u70b9\u540e\u591a\u5c11\u6761\u8fb9\u65e0\u6cd5\u8fde\u901a \u9898\u89e3 \u5e76\u67e5\u96c6\u652f\u6301\u52a0\u4e00\u4e9b\u70b9\u8fdb\u53bb\u6765\u5224\u65ad\u662f\u4e0d\u662f\u5728\u4e00\u4e2a\u96c6\u5408\uff0c\u4f46\u662f\u5982\u679c\u5220\u53bb\u4e00\u4e2a\u70b9\u5c31\u4e0d\u77e5\u9053\u591a\u5c11\u4e2a\u70b9\u4f1a\u53d7\u5f71\u54cd\uff0c\u6240\u4ee5\uff0c\u8fd9\u9053\u9898\u7684\u7cbe\u534e\u5c31\u662f\u5012\u8fc7\u6765\uff0c\u5148\u5c06\u90a3\u4e9b\u4ece\u6765\u6ca1\u6709\u9501\u5b9a\u7684\u70b9\u6784\u5efa\u5e76\u67e5\u96c6\uff0c\u7136\u540e\u5012\u8fc7\u6765\u5904\u7406\uff0c\u6bcf\u6b21\u91ca\u653e\u4e00\u4e2a\u70b9\uff0c\u5e76\u67e5\u96c6\u7ef4\u62a4\u6ca1\u6709\u9501\u5b9a\u70b9\u7684\u96c6\u5408\u3002 \u4ee3\u7801 #include <algorithm> #include <bitset> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <fstream> #include <iostream> #include <map> #include <queue> #include <set> #include <stack> #include <unordered_map> #include <unordered_set> #include <vector> #define x first #define y second #define endl '\\n' #define IOS \\ ios_base::sync_with_stdio(0); \\ cin.tie(0); \\ cout.tie(0); using […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[12,5],"class_list":["post-252","post","type-post","status-publish","format-standard","hentry","category-solution","tag-12","tag-5"],"_links":{"self":[{"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/posts\/252","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/solost.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=252"}],"version-history":[{"count":0,"href":"https:\/\/solost.cn\/index.php?rest_route=\/wp\/v2\/posts\/252\/revisions"}],"wp:attachment":[{"href":"https:\/\/solost.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=252"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/solost.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=252"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/solost.cn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=252"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}