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:T569,#include using namespace std; struct biparite { int n, m; vector match, seen; vector> adj; biparite(int _n, int _m) { n = _n, m = _m; match.resize(m, -1); seen.resize(n); adj.resize(n); } void addedge(int u, int v) { adj[u].push_back(v); } bool dfs(int i) { if(seen[i]) return 0; seen[i] = 1; for(int a: adj[i]) { if(match[a] == -1 || dfs(match[a])) { match[a] = i; return 1; } } return 0; } int solve() { int ans = 0; for(int i=0; i> n >> m; for(int i=0; i> arr[i]; } int r, c; int nxt = 0; for(int i=0; i= m) break; while(j < m && arr[i][j] == '*') hnum[i][j++] = nxt; nxt++; } } r = nxt; nxt = 0; for(int j=0; j= n) break; while(i < n && arr[i][j] == '*') vnum[i++][j] = nxt; nxt++; } } c = nxt; biparite bp(r, c); for(int i=0; i

코드 #3016