Submission #100393

#	Time	Username	Problem	Language	Result	Execution time	Memory
100393		Anai	Treasure (different grader from official contest) (CEOI13_treasure2)	C++14	44 / 100	3 ms	384 KiB

treasure

#include "treasure.h"
using namespace std;

const int N = 105;

int mx[N][N];

static int ask(int l1, int c1, int l2, int c2) {
	return countTreasure(l1, c1, l2, c2); }

void findTreasure(int n){
	for (int i = 1; i <= n; ++i)
	for (int j = 1; j <= n; ++j)
		mx[i][j] = ask(1, 1, i, j);

	for (int i = 1; i <= n; ++i)
	for (int j = 1; j <= n; ++j)
		if (mx[i][j] - mx[i - 1][j] - mx[i][j - 1] + mx[i - 1][j - 1] > 0)
			Report(i, j); }

• Subtask 1: 44 / 100