solved

Author: Yoo-Hyuna

2025-09-11/유현아/[BOJ]N-Queen_9663.cpp

@@ -0,0 +1,44 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+vector<bool> col, diag1, diag2;
+int N, cnt = 0;
+
+void dfs(int row) {
+	if (row >= N) {
+		cnt++;
+		return;
+	}
+
+
+	for (int c = 0; c < N; c++) {
+		if (col[c] || diag1[row+c] || diag2[row-c+N-1]) continue;
+	
+		col[c] = diag1[row + c] = diag2[row - c + N - 1] = true;
+
+		dfs(row + 1);
+		col[c] = diag1[row + c] = diag2[row - c + N - 1] = false;
+	
+	}
+	return;
+}
+
+
+int main() {
+	freopen_s(new FILE*, "input.txt", "r", stdin);
+	ios::sync_with_stdio(false);
+	cin.tie(nullptr);
+
+	cin >> N;
+	col.assign(N, false);
+	diag1.assign(2*N, false);
+	diag2.assign(2*N, false);
+
+	dfs(0);
+
+	cout << cnt;
+
+	return 0;
+}

2025-09-11/유현아/[BOJ]잃어버린 괄호_1541.cpp

@@ -0,0 +1,45 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+
+using namespace std;
+
+int main() {
+	freopen_s(new FILE*, "input.txt", "r", stdin);
+
+	string line, tep = "";
+	bool minu = false;	// ¸¶À̳ʽº °ª ½ÃÀÛÀ̸é
+
+	int total = 0;
+
+	cin >> line;
+	for (int i = 0; i < line.size(); i++) {
+		if (line[i] == '+') {
+			if (minu) total -= stoi(tep);
+			else {		
+				total += stoi(tep);
+			}
+			tep = "";
+		}
+		else if (line[i] == '-') {
+			if (minu) total -= stoi(tep);
+			else total += stoi(tep);
+			minu = true;
+			tep = "";
+		}
+		else {
+			tep = tep + line[i];
+		}
+
+		if (i == line.size() - 1) {
+			if (minu) total -= stoi(tep);
+			else {
+				total += stoi(tep);
+			}
+		}
+	}
+	
+	cout << total;
+
+	return 0;
+}

2025-09-11/유현아/[BOJ]토마토_7576.cpp

@@ -0,0 +1,105 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+
+using namespace std;
+
+struct Node {
+	int x=0;
+	int y=0;
+	int day =0;
+	bool visited = false;
+
+	Node() {}
+
+	Node(int x, int y, int day)
+		: x(x), y(y), day(day) {}
+
+	Node(int x, int y, int day, bool visited)
+		: x(x), y(y), day(day), visited(visited) {}
+
+};
+
+void ppp(vector<vector<Node>> map) {
+	cout << "=====================" << endl;
+	for (int i = 0; i < 4; i++) {
+		for (int j = 0; j < 6; j++) {
+			cout << map[i][j].day << " ";
+		}
+		cout << '\n';
+	}
+}
+
+
+int main() {
+	freopen_s(new FILE*, "input.txt", "r", stdin);
+	ios::sync_with_stdio(false);
+	cin.tie(nullptr);
+
+	int row, col;
+	cin >> col >> row;
+	vector<vector<Node>> map(row, vector<Node>(col));
+	queue<Node> q;
+
+	int dx[] = { -1, 0, 1, 0 }; 
+	int dy[] = { 0, 1, 0, -1 };
+
+	bool cho = false;
+
+	for (int i = 0; i < row; i++) {
+		for (int j = 0; j < col; j++) {
+			int state;
+			cin >> state;
+			if (state == 0) cho = true;
+			else if(state == 1) q.push({ i,j,1 });
+			map[i][j] = {i, j, state, state==-1? true:false};
+		}
+	}
+
+	if (cho == false) {
+		cout << 0;
+		return 0;
+	}
+
+
+
+	while (!q.empty()) 
+	{
+		Node currentNode = q.front();
+		q.pop();
+		for (int k = 0; k < 4; k++) {
+			int nx = currentNode.x + dx[k];
+			int ny = currentNode.y + dy[k];
+					
+			if (nx < 0 || nx >= row || ny < 0 || ny >= col) continue;
+			if (currentNode.visited) continue;
+
+			int nday = currentNode.day + 1;
+			if (nday >= map[nx][ny].day && map[nx][ny].day != 0) continue;
+			map[nx][ny].day = nday;
+			q.push({ nx, ny, nday });
+		}
+		map[currentNode.x][currentNode.y].visited = true;
+
+		//ppp(map);
+	}
+
+	bool notall = false;
+	int max = 0;
+	for (int i = 0; i < row; i++) {
+		for (int j = 0; j < col; j++) {
+			if (map[i][j].day == 0) {
+				cout << -1;
+				notall = true;
+				break;
+			}
+			if (max <= map[i][j].day) max = map[i][j].day;
+		}
+		if (notall == true) return 0;
+	}
+
+	cout << max-1;
+
+
+	return 0;
+}