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:T616,#include using namespace std; bool seen[50][50][10001]; char grid[50][51], text[10001]; int R, C, H, dr[] = {1, 0, -1, 0}, dc[] = {0, 1, 0, -1}; int32_t main() { cin.tie(0)->sync_with_stdio(0); cin >> R >> C; for(int i = 0; i < R; i++) { cin >> grid[i]; } cin >> text; H = strlen(text); queue> q; q.push({0, 0, 0}); seen[0][0][0] = 1; int dist = 0; while(q.size()) { int sz = q.size(); while(sz--) { auto [r, c, h] = q.front(); q.pop(); if(h == H && grid[r][c] == '*') { cout << dist + 1; return 0; } for(int i = 0; i < 4; i++) { int tr = r + dr[i], tc = c + dc[i]; while(tr >= 0 && tr < R && tc >= 0 && tc < C && grid[tr][tc] == grid[r][c]) { tr += dr[i]; tc += dc[i]; } if(!(tr >= 0 && tr < R && tc >= 0 && tc < C)) { continue; } if(!seen[tr][tc][h]) { seen[tr][tc][h] = 1; q.push({tr, tc, h}); } } if(h < H && grid[r][c] == text[h]) { if(!seen[r][c][h + 1]) { seen[r][c][h + 1] = 1; // printf("seen h = %d at dist = %d, r, c = %d, %d\n", h + 1, dist, r, c);

코드 #4321