제출 #39440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
39440		smu201111192	보물 찾기 (CEOI13_treasure2)	C++14	0 / 100	0 ms	2168 KiB

treasure

#include "treasure.h"
#include <cstdio>
#include <iostream>
int dp[105][105];
int chk[105][105];
int g(int y1,int x1,int y2,int x2){
    return dp[y2][x2] - dp[y1-1][x2] - dp[y2][x1-1] + dp[y1-1][x1-1];
}
void findTreasure (int N) {
    //if(cnt > 0) Report (1, 1);
    if(N <= 5){
        for(int i=1;i<=N;i++){
            for(int j=1;j<=N;j++){
                int cnt = countTreasure(i, j, i, j);
                if(cnt)Report(i,j);
            }
        }
        return;
    }
    for(int i=1;i<=N;i++){
        for(int j=1;j<=N;j++){
            int cnt = countTreasure(1,1,i,j);
            dp[i][j] = cnt;
        }
    }
    for(int i=1;i<=N;i++){
        for(int j=1;j<=N;j++){
            if(g(i,j,i,j)){
                Report(1,1);
            }
        }
    }
}

컴파일 시 표준 에러 (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)");
                                  ^

• Subtask 1: 0 / 100