제출 #39447

#제출 시각아이디문제언어결과실행 시간메모리
39447ykmyou보물 찾기 (CEOI13_treasure2)C++14
0 / 100
0 ms1220 KiB
#include "treasure.h" int tCnt[102][102];// (i, j) ~ (N, N) 합 void findTreasure (int N) { int mid = N / 2; for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { if (i <= mid) { if (j <= mid) // 1 사분면 tCnt[i][j] = countTreasure(i, j, N, N); else // 2 사분면 tCnt[i][j] = tCnt[i][1] - countTreasure(i, 1, N, j - 1); } else { if (j <= mid) // 3 사분면 tCnt[i][j] = tCnt[1][j] - countTreasure(1, j, i - 1, N); else // 4 사분면 tCnt[i][j] = (tCnt[1][j] + tCnt[i][1]) - (tCnt[1][1] + countTreasure(1, 1, i - 1, j - 1)); } } } for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { if (tCnt[i][j] + tCnt[i + 1][j + 1] - (tCnt[i][j + 1] + tCnt[i + 1][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...