1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T56e,#include using namespace std; #define rep(i, N) for(int i=0; i> R >> C; rep(r, R) rep(c, C) cin >> arr[r][c]; int k = 1; rep(r, R) rep(c, C) if(arr[r][c] && !num[r][c]) { par[k] = k; num[r][c] = k++; dfs(r, c); } for(int i=1; i> edges; rep(r, R) for(int c1=0, c2=0; c1= 0 && c2 < C && c2 - c1 > 1 && num[r][c1-1] && num[r][c2]) edges.push_back({c2-c1, num[r][c1-1], num[r][c2]}); } rep(c, C) for(int r1=0, r2=0; r1= 0 && r2 < R && r2 - r1 > 1 && num[r1-1][c] && num[r2][c]) edges.push_back({r2 - r1, num[r1-1][c], num[r2][c]}); } sort(edges.begin(), edges.end()); int ans = 0, cnt = 0; for(auto [w, u, v]: edges) if(f(u) != f(v)) { par[f(u)] = f(v); ans += w; cnt++; } cout << ((cnt != k - 2) ? -1 : ans); }5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-

코드 #4848