Submission #43501

#	Time	Username	Problem	Language	Result	Execution time	Memory
43501		Hassoony	보물 찾기 (CEOI13_treasure2)	C++14	44 / 100	2 ms	644 KiB

treasure

#include<bits/stdc++.h>

#include "treasure.h"
using namespace std;
typedef long long ll;
const int MX=102;

int grid[MX][MX],n;

void findTreasure (int N) {
    n=N;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            grid[i][j]=countTreasure(1,1,i,j);
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(grid[i][j]-grid[i-1][j]-grid[i][j-1]+grid[i-1][j-1])Report(i,j);
        }
    }
}

Compilation message (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: 44 / 100