Merge branch 'main' into 17-yuyu0830

InSange/BFS/18352.cpp

@@ -0,0 +1,143 @@
+//#include <iostream>
+//#include <queue>
+//#include <vector>
+//
+//using namespace std;
+//
+//int N, M, K, X, a, b, minDist;
+//deque<deque<int>> town;
+//queue<int> q;
+//vector<int> dist;
+//vector<int> answer;
+//
+//void Solve()
+//{
+//	cin >> N >> M >> K >> X;
+//	N++;
+//	town.assign(N, deque<int>());
+//	dist.assign(N, -1);
+//
+//	for (int i = 0; i < M; i++)
+//	{
+//		cin >> a >> b;
+//
+//		town[a].push_back(b);
+//	}
+//
+//	minDist = -1;
+//	q.push(X);
+//	dist[X] = 0;
+//
+//	while (!q.empty())
+//	{
+//		int cur = q.front();
+//		q.pop();
+//
+//		for (const int& val : town[cur])
+//		{
+//			if (dist[val] != -1) continue;
+//			q.push(val);
+//			dist[val] = dist[cur] + 1;
+//			minDist = max(minDist, dist[val]);
+//		}
+//	}
+//
+//	for (int i = 0; i < dist.size(); i++)
+//	{
+//		if (dist[i] == K) answer.push_back(i);
+//	}
+//
+//	if (answer.size())
+//	{
+//		for (const int& val : answer)
+//		{
+//			cout << val << "\n";
+//		}
+//	}
+//	else cout << -1;
+//}
+//
+//int main()
+//{
+//	cin.tie(nullptr);
+//	ios::sync_with_stdio(false);
+//
+//	Solve();
+//
+//	return 0;
+//}
+
+#include <iostream>
+#include <queue>
+#include <vector>
+
+using namespace std;
+
+int N, M, K, X, A, B;
+int cur, dist;
+queue<pair<int, int>> q;
+vector<vector<int>> towns;
+vector<bool> visited;
+priority_queue<int, vector<int>, greater<int>> answer;
+
+void Solve()
+{
+	cin >> N >> M >> K >> X;
+
+	N++;
+	towns.assign(N, vector<int>());
+	visited.assign(N, false);
+
+	while (M--)
+	{
+		cin >> A >> B;
+		towns[A].push_back(B);
+	}
+
+	q.push({ X, 0 });
+	visited[X] = true;
+
+	while (!q.empty())
+	{
+		cur = q.front().first;
+		dist = q.front().second;
+
+		q.pop();
+
+		if (dist == K)
+		{
+			answer.push(cur);
+			continue;
+		}
+
+		for (auto v : towns[cur])
+		{
+			if (visited[v]) continue;
+			q.push({ v, dist + 1 });
+			visited[v] = true;
+		}
+	}
+
+	if (answer.empty())
+	{
+		cout << -1;
+		return;
+	}
+
+	while (!answer.empty())
+	{
+		cout << answer.top() << "\n";
+		answer.pop();
+	}
+	return;
+}
+
+int main()
+{
+	cin.tie(nullptr);
+	ios::sync_with_stdio(false);
+
+	Solve();
+
+	return 0;
+}

InSange/README.md

@@ -12,6 +12,11 @@
 | 8차시 | 2024.04.09 |  투 포인터  | [두 용액](https://www.acmicpc.net/problem/2470)  | [#8](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/32)]
 | 9차시 | 2024.04.12 |  힙  | [Top K Frequent Words](https://leetcode.com/submissions/detail/1180988760/)  | [#9](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/28)]
 | 10차시 | 2024.04.30 |  스택  | [오아시스 재결합](https://www.acmicpc.net/problem/3015)  | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/40)]
-| 11차시 | 2024.05.03 |  DFS  | [숫자고르기](https://www.acmicpc.net/problem/2668)  | [#11](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/41)]
+| 11차시 | 2024.05.03 |  DFS  | [숫자고르기](https://www.acmicpc.net/problem/2668)  | [#11](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/41]
 | 12차시 | 2024.05.08 |  DP  | [전깃줄](https://www.acmicpc.net/problem/2565)  | [#12](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/46)]
+| 13차시 | 2024.05.22 |  BFS  | [특정 거리의 도시 찾기](https://www.acmicpc.net/problem/18352)  | [#13](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/53)]
+| 14차시 | 2024.05.27 |  투 포인터  | [포도주 시음](https://www.acmicpc.net/problem/31589)  | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/56)]
+| 15차시 | 2024.05.27 |  정렬  | [통나무 건너뛰기](https://www.acmicpc.net/problem/11497)  | [#15](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/57)]
+| 16차시 | 2024.06.28 |  그래프  | [Maximum_Total_Importance_ofRoads](https://leetcode.com/problems/maximum-total-importance-of-roads/)  | [#16](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/63)]
+| 17차시 | 2024.06.28 |  문자열  | [Zigzag Conversion](https://leetcode.com/problems/zigzag-conversion/)  | [#17](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/64)]
 ---

InSange/그래프/2285_Maximum_Total_Importance_of_Roads.cpp

@@ -0,0 +1,40 @@
+#include <vector>
+#include <queue>
+
+using namespace std;
+
+class Solution {
+public:
+    long long maximumImportance(int n, vector<vector<int>>& roads) {
+        vector<vector<int>> conn;   // road
+        priority_queue<pair<long long, int>> pq;  // connect degree first: degree, second: index
+        long long answer = 0;
+
+        conn.assign(n, vector<int>());
+
+        for (auto road : roads)
+        {
+            int v1 = road[0];
+            int v2 = road[1];
+
+            conn[v1].push_back(v2);
+            conn[v2].push_back(v1);
+        }
+
+        for (int i = 0; i < n; i++)
+        {
+            pq.push({ conn[i].size(), i });
+        }
+
+        while (!pq.empty())
+        {
+            pair<long long, int> cur;
+            cur = pq.top();
+            pq.pop();
+
+            answer += (n-- * cur.first);
+        }
+
+        return answer;
+    }
+};

InSange/문자열/6_Zigzag Conversion.cpp

@@ -0,0 +1,35 @@
+#include <vector>
+#include <iostream>
+
+using namespace std;
+
+class Solution {
+public:
+    string convert(string s, int numRows) {
+        if (numRows <= 1 || s.size() <= numRows) return s;
+
+        vector<string>v(numRows, "");
+
+        int i, j, dir;
+        j = 0;
+        dir = -1;
+
+        for (i = 0; i < s.size(); i++)
+        {
+            if (j == numRows - 1 || j == 0) dir *= -1;
+            v[j] += s[i];
+            if (dir == 1) j++;
+            else j--;
+        }
+
+        string answer;
+        answer = "";
+
+        for (auto c : v)
+        {
+            answer += c;
+        }
+
+        return answer;
+    }
+};

InSange/정렬/11497.cpp

@@ -0,0 +1,61 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+
+using namespace std;
+
+int T, N, num, answer;
+priority_queue < int> pq;
+deque<int> logs;
+
+void Solve()
+{
+	cin >> T;
+
+	while (T--)
+	{
+		answer = 0;
+		cin >> N;
+
+		for (int i = 0; i < N; i++)
+		{
+			cin >> num;
+			pq.push(num);
+		}
+
+		bool isLeft = true;
+
+		while (!pq.empty())
+		{
+			if (isLeft)	
+				logs.push_front(pq.top());
+			else //if(!isLeft)
+				logs.push_back(pq.top());
+
+			pq.pop();
+			isLeft = (isLeft ? false : true);
+		}
+
+		int lsize = logs.size();
+
+		for (int i = 0; i < lsize; i++)
+		{
+			int next = (i + 1) % lsize;
+			answer = max(answer, abs(logs[i] - logs[next]));
+		}
+
+		cout << answer << "\n";;
+		logs.clear();
+	}
+
+}
+
+int main()
+{
+	ios::sync_with_stdio(false);
+	cin.tie(nullptr);
+
+	Solve();
+
+	return 0;
+}

InSange/투포인터/31589.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int N, K, l, r, lastDrink;
+vector<int> wine;
+bool isLeft = false;
+long long answer = 0;
+
+void Solve()
+{
+	cin >> N >> K;
+
+	wine.assign(N, 0);
+
+	for (int i = 0; i < N; i++)
+	{
+		cin >> wine[i];
+	}
+
+	sort(wine.begin(), wine.end());
+
+	l = 0;
+	r = N - 1;
+	answer = 0;
+	lastDrink = 0;
+
+	while (K--)
+	{
+		if (isLeft == true)	// ¸À ¾ø´Â °Å
+		{
+			lastDrink = wine[l];
+			l++;
+		}
+		else// if(isLeft == false)	// ¸À ÀÖ´Â °Å
+		{
+			answer += wine[r] - lastDrink;
+			r--;
+		}
+
+		isLeft = (isLeft + 1) & 1;
+	}
+
+	cout << answer;
+}
+
+int main()
+{
+	ios::sync_with_stdio(false);
+	cin.tie(nullptr);
+
+	Solve();
+
+	return 0;
+}

seongwon030/DP/연속합.py

@@ -0,0 +1,6 @@
+n = int(input())
+m = list(map(int,input().split()))
+
+for i in range(1,n):
+  m[i] = max(m[i], m[i]+m[i-1])
+print(max(m))

seongwon030/README.md

@@ -14,6 +14,9 @@
 | 10차시 | 2024.05.07 |    수학    |     [연속 합](https://www.acmicpc.net/problem/2737)     | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/43) |
 | 11차시 | 2024.05.07 |     DP     |     [합분해](https://www.acmicpc.net/problem/2225)      | [#11](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/44) |
 | 12차시 | 2024.05.13 | 브루트포스 |   [암호만들기](https://www.acmicpc.net/problem/1759)    | [#12](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/50) |
-| 13차시 | 2024.05.23 |  분할정복  | [피보나치 수 6](https://www.acmicpc.net/problem/11444)  | [#13](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/54) |
+| 13차시 | 2024.05.23 |  분할정복  | [피보나치 수 6](https://www.acmicpc.net/problem/11444)  | [#13](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/55) |
+| 14차시 | 2024.05.28 |     큐     | [가운데를 말해요](https://www.acmicpc.net/problem/1655) | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/58) |
+| 15차시 | 2024.06.01 |     큐     |  [중앙값 구하기](https://www.acmicpc.net/problem/2696)  | [#15](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/61) |
+| 16차시 | 2024.07.04 |     DP     |     [연속합](https://www.acmicpc.net/problem/1912)      | [#16](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/66) |
 
 ---

yuyu0830/README.md

@@ -16,4 +16,6 @@
 | 12차시| 2024.05.13 |  해시  | [두 배열의 합](https://www.acmicpc.net/problem/2143)  | - |
 | 13차시| 2024.05.21 |  LIS  | [가장 긴 증가하는 부분 수열 2](https://www.acmicpc.net/problem/12015)  | - |
 | 14차시| 2024.07.02 |  위상정렬  | [ACM Craft](https://www.acmicpc.net/problem/1005)  | - |
+| 15차시| 2024.06.01 |  기하  | [다각형의 면적](https://www.acmicpc.net/problem/2166)  | - |
+| 16차시| 2024.06.04 |  별자리 만들기  | [별자리 만들기](https://www.acmicpc.net/problem/4386)  | - |
 ---