[Week 11] 크루스칼, 프림 -하윤

11-Kruskal&Prim/hayoun/백준1197.cpp

@@ -0,0 +1,56 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+int V, E;
+
+int parent[100001];
+vector<pair<pair<int, int>, int>> v;
+int visited[1000001] = {0};
+
+int find(int a)
+{
+    while (a != parent[a])
+    {
+        a = parent[a];
+    }
+    return a;
+}
+bool compare(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b)
+{
+    return a.second < b.second;
+}
+int main()
+{
+    cin >> V >> E;
+
+    for (int i = 0; i < E; i++)
+    {
+        int a, b, c;
+        cin >> a >> b >> c;
+        v.push_back({{a, b}, c});
+    }
+    for (int i = 1; i <= V; i++)
+    {
+        parent[i] = i;
+    }
+    long long ans = 0;
+    sort(v.begin(), v.end(), compare);
+    // for (int i = 0; i < v.size(); i++)
+    // {
+    //     cout << v[i].second;
+    // }
+    for (int i = 0; i < v.size(); i++)
+    {
+        if (find(v[i].first.first) == find(v[i].first.second))
+        {
+            continue;
+        }
+        else
+        {
+            ans = ans + v[i].second;
+            parent[find(v[i].first.second)] = find(v[i].first.first);
+        }
+    }
+    cout << ans;
+}

11-Kruskal&Prim/hayoun/백준1806.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+int N;
+long long S;
+long long num[1000001];
+int main()
+{
+    cin >> N >> S;
+    num[0] = 0;
+    for (int i = 1; i <= N; i++)
+    {
+        cin >> num[i];
+    }
+
+    for (int i = 1; i <= N; i++)
+    {
+        num[i] = num[i] + num[i - 1];
+    }
+
+    int min = 999999;
+    int start = 1;
+    int end = 1;
+
+    while (end <= N)
+    {
+        int sum = 0;
+        sum = num[end] - num[start - 1];
+
+        if (sum >= S)
+        {
+            if (min > end - start + 1)
+            {
+                min = end - start + 1;
+            }
+            start++;
+            if (start > end)
+            {
+                end++;
+            }
+        }
+        if (sum < S)
+        {
+            end++;
+        }
+    }
+    if (min == 999999)
+    {
+        min = 0;
+    }
+    cout << min;
+}

11-Kruskal&Prim/hayoun/백준1922.cpp

@@ -0,0 +1,52 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+int V, E;
+
+int parent[100001];
+vector<pair<pair<int, int>, int>> v;
+int visited[1000001] = {0};
+
+int find(int a)
+{
+    while (a != parent[a])
+    {
+        a = parent[a];
+    }
+    return a;
+}
+bool compare(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b)
+{
+    return a.second < b.second;
+}
+int main()
+{
+    cin >> V >> E;
+
+    for (int i = 0; i < E; i++)
+    {
+        int a, b, c;
+        cin >> a >> b >> c;
+        v.push_back({{a, b}, c});
+    }
+    for (int i = 1; i <= V; i++)
+    {
+        parent[i] = i;
+    }
+    long long ans = 0;
+    sort(v.begin(), v.end(), compare);
+    for (int i = 0; i < v.size(); i++)
+    {
+        if (find(v[i].first.first) == find(v[i].first.second))
+        {
+            continue;
+        }
+        else
+        {
+            ans = ans + v[i].second;
+            parent[find(v[i].first.second)] = find(v[i].first.first);
+        }
+    }
+    cout << ans;
+}

11-Kruskal&Prim/hayoun/백준27172.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int N;
+int card[10000001];
+int score[10000001] = {0};
+vector<int> numbers;
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+    cout.tie(nullptr);
+    cin >> N;
+
+    for (int i = 0; i < N; i++)
+    {
+        int a;
+        cin >> a;
+        numbers.push_back(a);
+        card[a] = 1;
+    }
+
+    for (int i = 0; i < N; i++)
+    {
+        for (int j = numbers[i] * 2; j < 1000001; j += numbers[i])
+        {
+            if (card[j] == 1 && j % numbers[i] == 0)
+            {
+                score[j]--;
+                score[numbers[i]]++;
+            }
+        }
+    }
+
+    for (int i = 0; i < N; i++)
+    {
+        cout << score[numbers[i]] << " ";
+    }
+}