1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-7c5a09ccd6f58860.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","643","static/chunks/app/codes/%5Bid%5D/page-7c5a09ccd6f58860.js"],"CodeViewer"] 1c:T6d0,#include using namespace std; const int MX = 100000, MXC = 1000000; struct Edge { int u, v, w; bool operator< (const Edge &e) const { return w < e.w; } }; struct DSU { int parent[MX], setsz[MX]; int find(int i){return parent[i] == i ? i : parent[i] = find(parent[i]);} void join(int i, int j) { i = find(i), j = find(j); if(i != j) { parent[i] = j; setsz[j] += setsz[i]; } } void reset() { for(int i=0; i query[MX]; int l[MX], r[MX], ans[MX]; vector check[MXC+2]; int main() { ios::sync_with_stdio(0);cin.tie(0); int n, m; cin >> n >> m; for(int i=0; i> edges[i].u >> edges[i].v >> edges[i].w; edges[i].u--, edges[i].v--; } sort(edges, edges+m); int q; cin >> q; for(int i=0; i> query[i].first >> query[i].second; query[i].first--, query[i].second--; } for(int i=0; i

코드 #2723