oj.uz

답안 #40574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40574 2018-02-05T07:01:04 Z pica4500 보물 찾기 (CEOI13_treasure2) C++
38 / 100
 2 ms 560 KB 
#include "treasure.h"
#include<iostream>
using namespace std;

int ptr = 0;
bool treasure[105][105];

int tot = 0;
int cur = 0;

bool chk(int r1, int c1, int r2, int c2) {
	if (r2 < r1 || c2 < c1) return false;
	return true;
}

int sum(int r1, int c1, int r2, int c2) {
	return ((r2 - r1 + 1) * (c2 - c1 + 1));
}

void solve(int r1, int c1, int r2, int c2) {
	if ((cur == tot) || !chk(r1, c1, r2, c2)) return;

	int midR = (r1 + r2) / 2;
	int midC = (c1 + c2) / 2;

	int LUr1 = r1;
	int LUc1 = c1;
	int LUr2 = midR;
	int LUc2 = midC;

	int LDr1 = midR + 1;
	int LDc1 = c1;
	int LDr2 = r2;
	int LDc2 = midC;

	int RUr1 = r1;
	int RUc1 = midC + 1;
	int RUr2 = midR;
	int RUc2 = c2;

	int RDr1 = midR + 1;
	int RDc1 = midC + 1;
	int RDr2 = r2;
	int RDc2 = c2;

	int LU = 0;
	int LD = 0;
	int RU = 0;
	int RD = 0;
	if (chk(LUr1, LUc1, LUr2, LUc2)) {
		if (cur == tot) return;
		LU = countTreasure(LUr1, LUc1, LUr2, LUc2);
		if (LU == sum(LUr1, LUc1, LUr2, LUc2)) {
			for (int i = LUr1; i <= LUr2; i++) {
				for (int j = LUc1; j <= LUc2; j++) {
					treasure[i][j] = true;
				}
			}
			cur += LU;
		}
		else {
			if(LU) solve(LUr1, LUc1, LUr2, LUc2);
		}
	}
	if (chk(LDr1, LDc1, LDr2, LDc2)) {
		if (cur == tot) return;
		LD = countTreasure(LDr1, LDc1, LDr2, LDc2);
		if (LD == sum(LDr1, LDc1, LDr2, LDc2)) {
			for (int i = LDr1; i <= LDr2; i++) {
				for (int j = LDc1; j <= LDc2; j++) {
					treasure[i][j] = true;
				}
			}
			cur += LD;
		}
		else {
			if(LD) solve(LDr1, LDc1, LDr2, LDc2);
		}
	}
	if (chk(RUr1, RUc1, RUr2, RUc2)) {
		if (cur == tot) return;
		RU = countTreasure(RUr1, RUc1, RUr2, RUc2);
		if (RU == sum(RUr1, RUc1, RUr2, RUc2)) {
			for (int i = RUr1; i <= RUr2; i++) {
				for (int j = RUc1; j <= RUc2; j++) {
					treasure[i][j] = true;
				}
			}
			cur += RU;
		}
		else {
			if(RU) solve(RUr1, RUc1, RUr2, RUc2);
		}
	}
	if (chk(RDr1, RDc1, RDr2, RDc2)) {
		if (cur == tot) return;
		RD = countTreasure(RDr1, RDc1, RDr2, RDc2);
		if (RD == sum(RDr1, RDc1, RDr2, RDc2)) {
			for (int i = RDr1; i <= RDr2; i++) {
				for (int j = RDc1; j <= RDc2; j++) {
					treasure[i][j] = true;
				}
			}
			cur += RD;
		}
		else {
			if(RD) solve(RDr1, RDc1, RDr2, RDc2);
		}
	}
}

void findTreasure (int N) {
    tot = countTreasure(1, 1, N, N);
	if (tot == 0) return;

	solve(1, 1, N, N);
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			if (treasure[i][j]) {
				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
38.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 248 KB Output isn't correct - N = 5, K = 671, score = 0
2 Incorrect 2 ms 480 KB Output isn't correct - N = 10, K = 10787, score = 0
3 Partially correct 2 ms 560 KB Output is partially correct - N = 15, K = 26258, score = 8
4 Correct 1 ms 560 KB Output is correct - N = 16, K = 27805, score = 10
5 Incorrect 2 ms 560 KB Output isn't correct - N = 55, K = 10876240, score = 0
6 Incorrect 2 ms 560 KB Output isn't correct - N = 66, K = 23026923, score = 0
7 Correct 2 ms 560 KB Output is correct - N = 77, K = 9563989, score = 10
8 Correct 2 ms 560 KB Output is correct - N = 88, K = 12591414, score = 10
9 Incorrect 2 ms 560 KB Output isn't correct - N = 99, K = 114265544, score = 0
10 Incorrect 2 ms 560 KB Output isn't correct - N = 100, K = 120385476, score = 0