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:T517,#include using namespace std; char arr[1500][1501]; bool seen[1500][1500]; int par[2250001], R, C, dr[] = {1,-1,0,0}, dc[] = {0,0,1,-1}, g1=-1, g2; int findp(int i) {return par[i] == i ? i : par[i] = findp(par[i]);} void join(int i, int j) { i = findp(i), j = findp(j); if(i != j) par[i] = j; } bool ok(int i, int j) { return 0 <= i && i < R && 0 <= j && j < C; } int to1d(int i, int j) { return i*C+j; } queue> que; void addpt(int r, int c) { for(int i=0; i<4; i++) { int tr = r+dr[i], tc = c+dc[i]; if(!ok(tr, tc)) continue; if(arr[tr][tc] == '.') join(to1d(tr, tc), to1d(r, c)); else if(!seen[tr][tc] && arr[tr][tc] == 'X') { seen[tr][tc] = 1; que.push({tr, tc}); } } } int main() { ios::sync_with_stdio(0);cin.tie(0); cin >> R >> C; for(int i=0; i> arr[i]; } for(int i=0; i

코드 #3460