Submission #42284

#	Time	Username	Problem	Language	Result	Execution time	Memory
42284		rlqja2222	보물 찾기 (CEOI13_treasure2)	C++14	0 / 100	1103 ms	262144 KiB

treasure

#include "treasure.h"
int row[101];
int col[101];
int n, c;

void div_col(int i, int j, int rest, int r) {
	if (c == n) return;
	if (rest == (j - i + 1)) {
		for (int k = i; k <= j; k++)
			row[c] = r, col[c] = k, c++;
		return;
	}
	else {
		int mid = (i + j) / 2;
		int rest1 = countTreasure(r, i, r, mid);
		if (rest1) div_col(i, mid, rest, r);
		int rest2 = countTreasure(r, mid + 1, r, j);
		if (rest2) div_col(mid + 1, j, rest, r);
	}
}

void div_row(int i, int j, int rest, int N) {	
	if (c == n) return;
	if (i != j) {
		int mid = (i + j) / 2;
		int rest1 = countTreasure(i, 1, mid, N);
		if (rest1) div_row(i, mid, rest1, N);
		int rest2 = countTreasure(mid + 1, 1, j, N);
		if (rest2) div_row(mid + 1, j, rest2, N);
	}
	else {
		div_col(1, N, rest, i);
	}
}


void findTreasure(int N) {
	n = countTreasure(1, 1, N, N);
	if (n == 0) return;
	c = 0;
	div_row(1, N, n, N);

	while (--c >= 0) 
		Report(row[c], col[c]);

}

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: 0 / 100