Submission #37290

#TimeUsernameProblemLanguageResultExecution timeMemory
37290aomeTreasure (different grader from official contest) (CEOI13_treasure2)C++14
100 / 100
0 ms2128 KiB
#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 (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...