19:I[10086,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","643","static/chunks/app/codes/%5Bid%5D/page-181bbdf63cf242d5.js"],"AdSenseInsert"] 1a:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","643","static/chunks/app/codes/%5Bid%5D/page-181bbdf63cf242d5.js"],"CodeViewer"] 1b:T555,#include using namespace std; struct Point{ int i, x, y, z; }; struct Edge { int u, v, dist; }; const int MX = 100000; Point arr[MX], arrx[MX], arry[MX], arrz[MX]; int parent[MX]; int findp(int i) {return i == parent[i] ? i : parent[i] = findp(parent[i]);} void join(int i, int j) { i = findp(i), j = findp(j); parent[i] = j; } int main() { ios::sync_with_stdio(0);cin.tie(0); int n; cin >> n; for(int i=0; i> arr[i].x >> arr[i].y >> arr[i].z; } memcpy(arrx, arr, sizeof arr); memcpy(arry, arr, sizeof arr); memcpy(arrz, arr, sizeof arr); sort(arrx, arrx+n, [](Point &a, Point &b){return a.x < b.x;}); sort(arry, arry+n, [](Point &a, Point &b){return a.y < b.y;}); sort(arrz, arrz+n, [](Point &a, Point &b){return a.z < b.z;}); vector edges; for(int i=1; i

코드 #1574