Submission #40572

#	Time	Username	Problem	Language	Result	Execution time	Memory
40572		didwlvv	Treasure (different grader from official contest) (CEOI13_treasure2)	C++14	41 / 100	2 ms	1064 KiB

treasure

#include "treasure.h"

int cnt;
int _map[105][105];

void init(int n) {
	cnt = 0;
	for (int i = 0; i <= n; i++)
		for (int j = 0; j <= n; j++)
			_map[i][j] = 0;

}

int dnc(int ly, int lx, int ry, int rx,int t) {
	if (ly == ry && lx == rx) {//한 칸 일때
		if (t) {
			_map[ly][lx] = 1;
			return 1;
		}
		return 0;
	}
	int tmp = t;
	int total = (ry - ly + 1)*(rx - lx + 1);
	if (tmp == total) {
		for (int i = ly; i <= ry; i++) {
			for (int j = lx; j <= rx; j++) {
				_map[i][j] = 1;
			}
		}
		return tmp;
	}
	int midy = (ly + ry) / 2;
	int midx = (lx + rx) / 2;
	int now_cnt = 0;
	int h_le = countTreasure(ly, lx, ry, midx);
	bool ok = true, ok1 = true;
	/*if (h_le == total / 2) {
		ok = false;
		for (int i = ly; i <= ry; i++) {
			for (int j = lx; j <= midx; j++) {
				_map[i][j] = 1;
			}
		}
		now_cnt += total / 2;
	}
	else if (tmp - h_le == total / 2) {
		ok1 = false;
		for (int i = ly; i <= ry; i++) {
			for (int j = midx + 1; j <= midx; j++) {
				_map[i][j] = 1;
			}
		}
		now_cnt += total / 2;
	}
	*/
	int f = countTreasure(ly, lx, midy, midx);
	if (ok && now_cnt < tmp)now_cnt += dnc(ly, lx, midy, midx,f);
	
	if (ok && now_cnt < tmp)now_cnt += dnc(ly, midx + 1, midy, rx, countTreasure(ly, lx, midy, rx)-f);

	if (ok1 && now_cnt < tmp)now_cnt += dnc(midy + 1, lx, ry, midx, h_le-f);
	
	if (ok1 && now_cnt < tmp)now_cnt += dnc(midy + 1, midx + 1, ry, rx,tmp-now_cnt);
	return now_cnt;

}
void findTreasure (int N) {
	init(N);
	//cnt = countTreasure(1, 1, N, N);
	dnc(1, 1, N, N,countTreasure(1,1,N,N));
	
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			if (_map[i][j])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: 41 / 100