1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","6706","static/chunks/6706-6cc81d14a1434b93.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-326ead655aaea8fc.js","9791","static/chunks/app/submission/%5Bid%5D/page-6b2d1d382b615dc8.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","6706","static/chunks/6706-6cc81d14a1434b93.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-326ead655aaea8fc.js","9791","static/chunks/app/submission/%5Bid%5D/page-6b2d1d382b615dc8.js"],"TestCaseDisplay"] 1b:T759,#include using namespace std; int main() { int n; cin >> n; vector> v(n, vector(3)); for(int i = 0; i < n; ++i){ cin >> v[i][0] >> v[i][1] >> v[i][2]; } vector>> dp1(n, vector>(3)); vector>> dp2(n, vector>(3)); for(int i = 0; i < 3; ++i){ dp1[0][i].first = v[0][i]; dp1[0][i].second = i; dp2[0][i].first = v[0][i]; dp2[0][i].second = i; } for(int i = 0; i < 3; ++i){ int left = (i+1)%3; int right = (i+2)%3; dp1[1][i].first = v[1][i] + dp1[0][left].first; dp1[1][i].second = dp1[0][left].second; dp2[1][i].first = v[1][i] + dp2[0][right].first; dp2[1][i].second = dp2[0][right].second; } for(int i = 2; i < n-1; ++i){ for(int j = 0; j < 3; ++j){ int l = (j+1)%3; int r = (j+2)%3; if(dp1[i-1][l].first < dp1[i-1][r].first){ dp1[i][j].first = v[i][j] + dp1[i-1

제출 #66304

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: