제출 #362662

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
362662		tndud2612	보물 찾기 (CEOI13_treasure2)	C++17	0 / 100	1 ms	492 KiB

treasure

#include "treasure.h"
#include <queue>
#include <utility>
#include <vector>

using namespace std;

void findTreasure (int N) {

	int dir = 0;
    int cnt = countTreasure(1, 1, N, N);
	if (cnt == 0) {
		return;
	}

	queue<vector<int>> q;
	q.push({ 1, 1, N, N });

	while (cnt) {
		vector<int> tmp;
		tmp = q.front();
		if (tmp[1] == tmp[3] && tmp[0] == tmp[2]) {
			cnt--;
			Report(tmp[0], tmp[1]);
		}
		q.pop();
		if (dir && tmp[1] != tmp[3]) {
			int mid = (tmp[1] + tmp[3]) / 2;
			if (countTreasure(tmp[0], mid + 1, tmp[2], tmp[3])) {
				q.push({ tmp[0], mid + 1, tmp[2], tmp[3] });
			}
			if (countTreasure(tmp[0], tmp[1], tmp[2], mid)) {
				q.push({ tmp[0], tmp[1], tmp[2], mid });
			}
			dir = 0;
		}
		else if(!dir && tmp[0] != tmp[2]) {
			int mid = (tmp[0] + tmp[2]) / 2;
			if (countTreasure(mid + 1, tmp[1], tmp[2], tmp[3])) {
				q.push({ mid + 1, tmp[1], tmp[2], tmp[3] });
			}
			if (countTreasure(mid + 1, tmp[1], tmp[2], tmp[3])) {
				q.push({ tmp[0], tmp[1], mid, tmp[3] });
			}
			dir = 1;
		}
	}
}

• Subtask 1: 0 / 100