1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","9362","static/chunks/9362-e9f488fde79ed646.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","9992","static/chunks/9992-c6b29c96d53cc0fe.js","9211","static/chunks/9211-2c147ebefe26b47c.js","9791","static/chunks/app/submission/%5Bid%5D/page-47099a350c9e7e40.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5538","static/chunks/5538-ed47f067afaa5003.js","7412","static/chunks/7412-2a540dc7a2630d42.js","9362","static/chunks/9362-e9f488fde79ed646.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","9992","static/chunks/9992-c6b29c96d53cc0fe.js","9211","static/chunks/9211-2c147ebefe26b47c.js","9791","static/chunks/app/submission/%5Bid%5D/page-47099a350c9e7e40.js"],"TestCaseDisplay"] 1b:T420,#include #include using namespace std; int n, m; int dp[1000][1000]; int ans; void input() { cin >> n >> m; for (int i = 0;i < n;i++) { string temp; cin >> temp; for (int j = 0;j < m;j++) { dp[i][j] = temp[j] - '0'; if (dp[i][j] == 1) ans = 1; } } } void check(int x, int y) { for (int i = 1;i <= sqrt(dp[x - 1][y - 1]);i++) { if (dp[x - i][y] == 0 || dp[x][y - i] == 0) return; } for (int i = 1;i <= sqrt(dp[x - 1][y - 1]);i++) { if (dp[x - i][y] < dp[x - 1][y - 1]) dp[x - i][y] = dp[x - 1][y - 1]; if (dp[x][y - i] < dp[x - 1][y - 1]) dp[x][y - i] = dp[x - 1][y - 1]; } if (dp[x][y] < pow(sqrt(dp[x - 1][y - 1]) + 1, 2)) dp[x][y] = pow(sqrt(dp[x - 1][y - 1]) + 1, 2); if (ans < dp[x][y]) ans = dp[x][y]; } void solution() { for (int i = 1;i < n;i++) { for (int j = 1;j < m;j++) { if (dp[i - 1][j - 1] == 0

제출 #90417

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: