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:T423,#include using namespace std; #define int long long struct st { int b, j; }; int init[50][50], arr[50][50], init_a[50], b[50], a[50], n, m; st v[50]; bool chk() { memcpy(a, init_a, sizeof a); for(int j=0; j y.b;}); for(st& t: v) { if(a[i] <= 0) break; if(t.b <= 0) break; if(init[i][t.j] != -1) continue; a[i]--; t.b--; } if(a[i] > 0) return 0; } return 1; } int32_t main() { cin >> n >> m; memset(init, -1, sizeof init); memset(arr, -1, sizeof arr); for(int i=0; i> init_a[i]; for(int i=0; i> b[i]; if(accumulate(init_a, init_a+n, 0ll) != accumulate(b, b+m, 0ll)) return !(cout << -1); if(!chk()) return !(cout << -1); for(int i=0; i

코드 #2614