제출 #39586

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

treasure

#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;

const int MAX = 105;
int a[MAX][MAX];

void findTreasure(int n) {
  int mid = (n / 2);

  for (int i = mid + 1; i <= n; ++i) {
  	for (int j = mid + 1; j <= n; ++j) {
  		a[i][j] = countTreasure(1, 1, i, j);
  	}
  }

  for (int i = mid + 1; i <= n; ++i) {
  	for (int j = 1; j <= mid; ++j) {
  		a[i][j] = a[i][n] - countTreasure(1, j + 1, i, n);
  	}
  }

  for (int i = 1; i <= mid; ++i) {
  	for (int j = mid + 1; j <= n; ++j) {
  		a[i][j] = a[n][j] - countTreasure(i + 1, 1, n, j);
  	}
  }

  for (int i = 1; i <= mid; ++i) {
  	for (int j = 1; j <= mid; ++j) {
  		a[i][j] = (a[i][n] + a[n][j] + countTreasure(i + 1, j + 1, n, n)) - a[n][n];
  	}
  }

	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			if (a[i][j] - a[i - 1][j] - a[i][j - 1] + a[i - 1][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)");
                                  ^

• Subtask 1: 100 / 100