제출 #40811

#제출 시각아이디문제언어결과실행 시간메모리
40811hsb154보물 찾기 (CEOI13_treasure2)C++14
44 / 100
20 ms604 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 r1,int c1,int r2, int c2) { int cnt = 0; for (int i = r1; i <= r2; i++) for (int j = c1; j <= c2; 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++) { int lowCnt = 0; if (i == N) lowCnt = 0; else lowCnt = countTreasure(i+1, 1, N, N); for (int j = 1; j <= N; j++) { if (i + j < N/2) { if (cnt != count(i, 1, i, j) + lowCnt + (j == N ? 0 : countTreasure(i, j + 1, N, N)) - (j == N||i==N ? 0 : countTreasure(i + 1, j + 1, N, N))) { map[i][j] = 1; } } else { if (countTreasure(1, 1, i, j) != count(1, 1, i, j)) { map[i][j] = 1; } } } cnt -= count(i, 1, i, N); } 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)");
                                  ^
treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:15:6: warning: unused variable 'myCnt' [-Wunused-variable]
  int myCnt = 0;
      ^
#Verdict Execution timeMemoryGrader output
Fetching results...