제출 #362709

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

treasure

#include "treasure.h"
#include <queue>
#include <utility>
#include <vector>
#include <iostream>
 
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 });
	vector<pair<int, int>> result;
 
	while (cnt) {
		vector<int> tmp;
		tmp = q.front();
		cout << tmp[0] << " " << tmp[1] << " " << tmp[2] << " " << tmp[3] << endl;
		if (tmp[1] == tmp[3] && tmp[0] == tmp[2]) {
			cnt--;
			result.push_back(make_pair(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;
		}
	}
	for (int i = 0; i < result.size(); i++) {
		Report(result[i].first, result[i].second);
	}
 
}
 

컴파일 시 표준 에러 (stderr) 메시지

treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:51:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |  for (int i = 0; i < result.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~

• Subtask 1: 0 / 100