제출 #5751

#제출 시각아이디문제언어결과실행 시간메모리
5751baneling100보물 찾기 (CEOI13_treasure2)C++98
0 / 100
0 ms1224 KiB
#include "treasure.h" int Check[101][101]; void Quad_Search(int ly, int lx, int ry, int rx) { int midy=(ly+ry)/2, midx=(lx+rx)/2; if(ly==ry && lx==rx) Check[ly][lx]=1; else { if(countTreasure(ly,lx,midy,midx)) Quad_Search(ly,lx,midy,midx); if(countTreasure(ly,midx+1,midy,rx)) Quad_Search(ly,midx+1,midy,rx); if(countTreasure(midy+1,rx,ry,midx)) Quad_Search(midy+1,rx,ry,midx); if(countTreasure(midy+1,midx+1,ry,rx)) Quad_Search(midy+1,midx+1,ry,rx); } } void findTreasure(int N) { int i, j; Quad_Search(1,1,N,N); for(i=1 ; i<=N ; i++) for(j=1 ; j<=N ; j++) if(Check[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...