oj.uz

답안 #37290

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
37290 2017-12-23T13:52:27 Z aome 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 0 ms 2128 KB 
#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 105;

int a[N][N];

void findTreasure (int n) {
	for (int i = n / 2 + 1; i <= n; ++i) {
		for (int j = n / 2 + 1; j <= n; ++j) {
			a[i][j] = countTreasure(1, 1, i, j);
		}
	}
	for (int i = n / 2 + 1; i <= n; ++i) {
		for (int j = 1; j <= n / 2; ++j) {
			a[i][j] = a[i][n] - countTreasure(1, j + 1, i, n);
		}
	}
	for (int i = 1; i <= n / 2; ++i) {
		for (int j = n / 2 + 1; j <= n; ++j) {
			a[i][j] = a[n][j] - countTreasure(i + 1, 1, n, j);
		}
	}
	for (int i = 1; i <= n / 2; ++i) {
		for (int j = 1; j <= n / 2; ++j) {
			a[i][j] = (a[i][n] + a[n][j]) - (a[n][n] - countTreasure(i + 1, j + 1, 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);
			}
		}
	}
}

Compilation message

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.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2128 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 0 ms 2128 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 0 ms 2128 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 0 ms 2128 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 0 ms 2128 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 0 ms 2128 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 0 ms 2128 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 0 ms 2128 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 0 ms 2128 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 0 ms 2128 KB Output is correct - N = 100, K = 43760000, score = 10