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:T55f,#include #include #include #include int main(){ int memo[102] = {0,}; for (int i=0;i<101;i++){ memo[i] = 99999999; } int num_ladder, num_snake; std::cin>>num_ladder>>num_snake; std::map ladders; std::map snakes; for (int i=0;i>tmp1>>tmp2; ladders[tmp1] = tmp2; } for (int i=0;i>tmp1>>tmp2; snakes[tmp1] = tmp2; } memo[1] = 0; for (int idx=2;idx<=6;idx++){ memo[idx] = 1; if (ladders.count(idx)){ memo[ladders[idx]] = memo[idx]; } } int idx = 7; while (true){ auto prev = std::vector{memo[idx-6]+1, memo[idx-5]+1, memo[idx-4]+1, memo[idx-3]+1, memo[idx-2]+1, memo[idx-1]+1, memo[idx]}; memo[idx] = *std::min_element(prev.begin(), prev.e

제출 #129299

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: