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:T447,#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; int dx[] = { 1, 0, -1, 0 }; int dy[] = { 0, 1, 0, -1 }; int d[200001]; int main() { ios::sync_with_stdio(false); cin.tie(0); ::fill(d, d + 200001, -1); int n, k; cin >> n >> k; queue q; q.push(n); d[n] = 0; while (q.front() != k) { int cur = q.front(); q.pop(); int next[] = { cur - 1, cur + 1, cur * 2 }; for (int dir = 0; dir < 3; dir++) { if (next[dir] < 0 || next[dir] >= 100000) continue; if (d[next[dir]] >= 0) continue; if (dir == 2) d[next[dir]] = d[cur]; else

제출 #127510

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: