Submission #94708

#	Time	Username	Problem	Language	Result	Execution time	Memory
94708		wogns1026	보물 찾기 (CEOI13_treasure2)	C++14	10 / 100	2 ms	376 KiB

treasure

#include "treasure.h"

struct Node {
	int x;
	int y;
};
/*int nodecnt;
Node nodepool[10001];
Node* newnode(int px, int py) {
Node *tmp = newnode(px, py);
return &nodepool[nodecnt++];
}
struct List {
Node *head;
Node *tail;

void init() {
nodecnt = 0;
head = newnode(0, 0);
tail = newnode(0, 0);
head->next = tail;
}

};*/

Node ans[10001];
int idx = 0;

/*void func(int x1, int y1, int x2, int y2) {
	if (x1 == x2 && y1 == y2) {
		ans[idx].x = x1;
		ans[idx].y = y1;
	
		idx++;
	}
	if (countTreasure(x1, y1, x2 / 2, y2 / 2) != 0) {

	}
	else if (countTreasure(x1, y2 / 2, x2 / 2, y2) != 0) {

	}
	else if (countTreasure(x1 / 2, ))


}*/

void findTreasure(int N) {
	int cnt = 0;
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			cnt = countTreasure(i, j, i, j);
			if (cnt == 1) {
				ans[idx].x = i;
				ans[idx].y = j;
				idx++;
			}
		}
	}
	for (int i = 0; i < idx; i++) {
		Report(ans[i].x, ans[i].y);
	}
}

• Subtask 1: 10 / 100