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:T62a,#include #include #include #include #include #include #include #define MOD 1000000007 #define ll long long #define sz(x) ((int)(x).size()) #define rep(i, n) for(int i=0; i<(n); i++) #define set0(arr) memset(arr, 0, sizeof(arr)) using namespace std; int dr[] = {1,-1,0,0}, dc[] = {0,0,1,-1}; inline bool isvalid(int r, int c, int n, int m) { return r>=0 && r=0 && c> m >> n; vector arr(n); rep(i, n) cin >> arr[i]; queue> vstque, wallque; bool visited[n][m]; set0(visited); vstque.emplace(0,0); visited[0][0] = true; int ans = 0; while(1) { while(!vstque.empty()) { // visit. if wall, push to wallque. if (n-1,m-1): break. auto vst = vstque.front(); vstque.pop(); int r = vst.first, c = vst.second; if(r == n-1 && c == m-1) return !(cout << ans); rep(i, 4) { int tr = r+dr[i], tc = c+dc[i]; //printf("visiting %d,%d -> %d,%d..\n", r,c,tr,tc); if(!isvalid(tr,tc,n,m) || visited[tr][tc]) continue; visited[tr][tc] = true; if(arr[tr][tc] == '0') { vstque.emplace(tr,tc); //printf("ans=%d: emplace %d,%d to vstque\n", ans, tr, tc); } else if(arr[tr][tc] == '1') wallque.emplace(tr,tc); } //printf(

코드 #2203