Today ps

Author: KHJcode

.gitignore

@@ -35,3 +35,4 @@
 
 cmake-build-debug/
 build/
+*.cph/

Baekjoon/Cpp/1041.cpp

@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = long long;
+using pll = pair<ll, ll>;
+
+bool compare(pll a, pll b)
+{
+    return min(a.first, a.second) < min(b.first, b.second);
+}
+
+int main()
+{
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    ll n, i, c, d1, d2, d3, sum = 0, mx = 0, dice[6];
+    pll af, cd, be;
+    cin >> n;
+    for (i = 0; i < 6; i++)
+    {
+        cin >> dice[i];
+        mx = max(dice[i], mx);
+        sum += dice[i];
+    }
+    af = make_pair(dice[0], dice[5]);
+    cd = make_pair(dice[2], dice[3]);
+    be = make_pair(dice[1], dice[4]);
+    pll arr[3] = {af, cd, be};
+    sort(arr, arr + 3, compare);
+    c = 0;
+    if (n == 1)
+    {
+        cout << sum - mx;
+    }
+    else
+    {
+        d1 = min(arr[0].first, arr[0].second);
+        d2 = min(arr[1].first, arr[1].second);
+        d3 = min(arr[2].first, arr[2].second);
+        c += (d1 + d2 + d3) * 4;
+        c += (d1 + d2) * (4 + (n - 2) * 8);
+        c += d1 * (n * n * 5 - 12 - (4 + (n - 2) * 8) * 2);
+        cout << c;
+    }
+    return 0;
+}

Baekjoon/Cpp/11779.cpp

@@ -0,0 +1,85 @@
+#include <bits/stdc++.h>
+#define INF 9223372036854775807
+
+using namespace std;
+using ll = long long;
+using pll = pair<ll, ll>;
+using plvl = pair<ll, vector<ll>>;
+
+ll dis[1001], cost[1001][1001];
+bool vst[1001][1001];
+
+struct compare
+{
+    bool operator()(const plvl &a, const plvl &b) const
+    {
+        return a.first > b.first;
+    }
+};
+
+int main()
+{
+    ios_base::sync_with_stdio(0);
+    cin.tie(0);
+    ll n, m, a, b, c, i, s, e;
+    vector<ll> cv, gph[1001];
+    plvl cr, res;
+    priority_queue<plvl, vector<plvl>, compare> pq;
+    cin >> n >> m;
+    while (m--)
+    {
+        cin >> a >> b >> c;
+        if (a == b)
+        {
+            continue;
+        }
+        else if (vst[a][b])
+        {
+            cost[a][b] = min(cost[a][b], c);
+        }
+        else
+        {
+            gph[a].push_back(b);
+            vst[a][b] = true;
+            cost[a][b] = c;
+        }
+    }
+    cin >> s >> e;
+    for (i = 1; i <= n; i++)
+    {
+        dis[i] = INF;
+    }
+    cv.push_back(s);
+    dis[s] = 0;
+    pq.push(make_pair(0, cv));
+    while (pq.empty() == false)
+    {
+        cr = pq.top();
+        cv = cr.second;
+        pq.pop();
+        c = cv.back();
+        if (c == e)
+        {
+            res = cr;
+            break;
+        }
+        for (auto i : gph[c])
+        {
+            if (cost[c][i] + cr.first < dis[i])
+            {
+                dis[i] = cost[c][i] + cr.first;
+                cv.push_back(i);
+                pq.push(make_pair(dis[i], cv));
+                cv.pop_back();
+            }
+        }
+    }
+    cout << res.first << "\n";
+    b = res.second.size();
+    cout << b << "\n";
+    for (i = 0; i < b; i++)
+    {
+        cout << res.second[i] << " ";
+    }
+    return 0;
+}