Merge branch 'master' of https://github.com/JangKeon/BOJ

Author: JangKeon

BOJ/이중 우선순위 큐_re.cpp

@@ -0,0 +1,65 @@
+#include <iostream>
+#include <queue>
+#include <unordered_map>
+using namespace std;
+
+int main(void) {
+	ios_base::sync_with_stdio(0);
+	cin.tie(0); cout.tie(0);
+
+	int T, N;
+	cin >> T;
+	for (int k = 0; k < T; k++) {
+		int size = 0;
+		unordered_map <int, int> visited;
+		priority_queue <int> MaxHeap;
+		priority_queue <int, vector <int>, greater<>> MinHeap;
+		cin >> N;
+		for (int i = 0; i < N; i++) {
+			char opt;
+			int num;
+			cin >> opt >> num;
+			if (!size) {
+				MaxHeap = priority_queue <int>();
+				MinHeap = priority_queue <int, vector <int>, greater<>>();
+			}
+			if (opt == 'I') {
+				MaxHeap.push(num);
+				MinHeap.push(num);
+				size++;
+				visited[num]++;
+			}
+			else {
+				if (!size)	continue;
+				else if (opt == 'D' && num == 1) {
+					while (!MaxHeap.empty() && !visited[MaxHeap.top()]) {
+						MaxHeap.pop();
+					}
+					visited[MaxHeap.top()]--;
+					MaxHeap.pop();
+					size--;
+				}
+				else if (opt == 'D' && num == -1) {
+					while (!MinHeap.empty() && !visited[MinHeap.top()]) {
+						MinHeap.pop();
+					}
+					visited[MinHeap.top()]--;
+					MinHeap.pop();
+					size--;
+				}
+			}
+			while (!MaxHeap.empty() && !visited[MaxHeap.top()]) {
+				MaxHeap.pop();
+			}
+			while (!MinHeap.empty() && !visited[MinHeap.top()]) {
+				MinHeap.pop();
+			}
+		}
+		if (size == 0) {
+			cout << "EMPTY\n";
+		}
+		else {
+			cout << MaxHeap.top() << ' ' << MinHeap.top() << '\n';
+		}
+	}
+}

BOJ_Class3/토마토_re.cpp

@@ -0,0 +1,66 @@
+#include <iostream>
+#include <queue>
+#include <vector>
+using namespace std;
+
+typedef struct tomato {
+	int x;
+	int y;
+};
+
+int map[1002][1002];
+queue <tomato> que;
+int N, M, num, res = 0;
+
+int dx[4] = { 0, 1, 0, -1 };
+int dy[4] = { 1, 0, -1, 0 };
+
+void bfs() {
+	int nx, ny;
+	while (!que.empty()) {
+		int x = que.front().x;
+		int y = que.front().y;
+		que.pop();
+		for (int i = 0; i < 4; i++) {
+			nx = x + dx[i];
+			ny = y + dy[i];
+			if (nx < 0 || nx >= N || ny < 0 || ny >= M) {
+				continue;
+			}
+			if (map[nx][ny]) {
+				continue;
+			}
+			map[nx][ny] = map[x][y] + 1;
+			que.push({ nx, ny });
+		}
+	}
+}
+
+int main(void) {
+	ios_base::sync_with_stdio(0);
+	cin.tie(0); cout.tie(0);
+
+	cin >> M >> N;
+	for (int i = 0; i < N; i++) {
+		for (int j = 0; j < M; j++) {
+			cin >> map[i][j];
+			if (map[i][j] == 1) {
+				que.push({ i, j });
+			}
+		}
+	}
+	bfs();
+	int res = 0;
+	for (int i = 0; i < N; i++) {
+		for (int j = 0; j < M; j++) {
+			if (map[i][j] == 0) {
+				cout << "-1\n";
+				return 0;
+			}
+			if (res < map[i][j]) {
+				res = map[i][j];
+			}
+		}
+	}
+	cout << res - 1;
+}