제출 #40788

#제출 시각아이디문제언어결과실행 시간메모리
40788hsb154보물 찾기 (CEOI13_treasure2)C++14
44 / 100
22 ms640 KiB
#include "treasure.h" int countTreasure(int r1, int c1, int r2, int c2); void Report(int r, int c); bool map[101][101]; int count(int r, int c) { int cnt = 0; for (int i = 1; i <= r; i++) for (int j = 1; j <= c; j++) if (map[i][j]) cnt++; return cnt; } void findTreasure(int N) { int cnt = countTreasure(1, 1, N, N); int myCnt = 0; for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { if (countTreasure(1, 1, i, j) != count(i, j)) { map[i][j] = 1; myCnt++; } if (myCnt == cnt) { i = N + 1; break; } } } for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { if (map[i][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...