제출 #40778

#제출 시각아이디문제언어결과실행 시간메모리
40778bysu보물 찾기 (CEOI13_treasure2)C++14
48 / 100
2 ms676 KiB
#include "treasure.h" int dp[101][101]; int func(int r, int c) { if (dp[r][c] == -1) { dp[r][c] = countTreasure(1,1,r,c); if (dp[r][c] == 0) { for (int i = 1; i <= r; i++) { for (int j = 1; j <= c; j++) { dp[i][j] = 0; } } } } return dp[r][c]; } void findTreasure (int N) { for (int i = 1; i < 101; i++) { for (int j = 1; j < 101; j++) { dp[i][j] = -1; } } for (int i = N; i > 0; i--) { for (int j = N; j > 0; j--) { func(i, j); } } for (int i = N; i > 0; i--) { for (int j = N; j > 0; j--) { if (dp[i][j] - dp[i - 1][j] - dp[i][j - 1] + dp[i - 1][j - 1]) { Report(i, j); } } } }

컴파일 시 표준 에러 (stderr) 메시지

grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
                                  ^
#Verdict Execution timeMemoryGrader output
Fetching results...