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:T536,#include #define MOD 1000000007 #define rep(i, n) for(int i=0; i<(n); i++) using namespace std; #define MAXN 16 int n; pair dp[1< solve(int bitmask, int x) { if(dp[bitmask][x].second != -1 ) { // memoized return dp[bitmask][x]; } if(isPowerOf2(bitmask)) { // base case(1 node to traverse) dp[bitmask][x].first = 0; dp[bitmask][x].second = x; return dp[bitmask][x]; } dp[bitmask][x] = {MOD, x}; int nextbm = bitmask ^ (1 << x); rep(i, n) { // x -> i -> ... -> end(dp[bitmask][i].second) if(nextbm & (1< dist[x][i] + pr.first) { dp[bitmask][x].first = dist[x][i] + pr.first; dp[bitmask]

제출 #135451

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: