1a: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","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T66d,#include #include #include #include using namespace std; typedef struct { int y, x; }C; int n, m, cheese, map[1001][1001], dx[] = { -1,1,0,0 }, dy[] = {0,0,-1,1},ans=0; C startpoint[10]; bool visit[1001][1001]; void printall() { for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cout << map[i][j]; } cout << '\n'; } } int main() { ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> n >> m >> cheese; for (int i = 0; i < n; ++i) { string s; cin >> s; for (int j = 0; j < m; ++j) { if (s[j] == 'X') map[i][j] = -1; else if (s[j] == '.') map[i][j] = 0; else if (s[j] == 'S') { map[i][j] = 0; startpoint[0] = {i,j}; } else { map[i][j] = 0; startpoint[s[j] - '0'] = { i,j }; } } } for (int i = 0; i <= cheese-1; ++i) { memset(visit,0,sizeof(visit)); queue q; visit[startpoint[i].y][startpoint[i].x] = true; q.push({startpoint[i].

제출 #101858

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: