제출 #26952

#제출 시각아이디문제언어결과실행 시간메모리
26952sgc109보물 찾기 (CEOI13_treasure2)C++11
44 / 100
0 ms1268 KiB
#include "treasure.h" int dp[103][103]; int exist[103][103]; void findTreasure (int N) { for(int i = 1; i <= N; i++){ for(int j = 1 ; j <= N; j++){ int cnt = countTreasure(1, 1, i, j); int know = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]; if(cnt != know) exist[i][j] = 1; dp[i][j] = cnt; } } for(int i = 1; i <= N; i++){ for(int j = 1; j <= N; j++){ if(exist[i][j]) 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...