New: total 1

.cph/.「USACO3.2」Sweet Butter.cpp_08995cbbcc32c95b03ce321a2fe4b455.prob

@@ -0,0 +1 @@
+{"name":"Local: 「USACO3","url":"/workspaces/OI-Codes/「USACO3.2」Sweet Butter.cpp","tests":[{"id":1739503655378,"input":"3 4 5\n2\n3\n4\n1 2 1\n1 3 5\n2 3 7\n2 4 3\n3 4 5","output":"8"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"/workspaces/OI-Codes/「USACO3.2」Sweet Butter.cpp","group":"local","local":true}

fame

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+#define lo long long
+#define INF INT_MAX
+#define LLM LONG_LONG_MAX
+
+using namespace std;
+const int N = 1e7 + 10;
+/*
+    toothless. #17
+    @fredcss_dev
+*/
+
+signed main()
+{
+
+    return 0;
+}
+

「USACO3.2」Sweet Butter.cpp

@@ -0,0 +1,84 @@
+#include <bits/stdc++.h>
+#define lo long long
+#define INF INT_MAX
+#define LLM LONG_LONG_MAX
+
+using namespace std;
+const int N = 1e7 + 10;
+/*
+    toothless. #17
+    @fredcss_dev
+*/
+
+int n;
+int p;
+int c;
+int mp[800][805];
+int d[805][805];
+int mark[805];
+const int inf = 9999999;
+int res = inf;
+
+signed main()
+{
+    cin >> n >> p >> c;
+    for (int i = 0; i < p; i++)
+    {
+        for (int j = 0; j < p; j++)
+        {
+            if (i == j)
+            {
+                mp[i][j] = 0;
+                d[i][j] = 0;
+            }
+            else
+            {
+                mp[i][j] = inf;
+                d[i][j] = inf;
+            }
+        }
+    }
+    for (int i = 0; i < n; i++)
+    {
+        int t;
+        scanf("%d", &t);
+        mark[t - 1]++;
+    }
+    for (int i = 0; i < c; i++)
+    {
+        int u;
+        int v;
+        int val;
+        scanf("%d%d%d", &u, &v, &val);
+        mp[u - 1][v - 1] = val;
+        mp[v - 1][u - 1] = val;
+        d[u - 1][v - 1] = val;
+        d[v - 1][u - 1] = val;
+    }
+    for (int k = 0; k < p; k++)
+    {
+        for (int i = 0; i < p; i++)
+        {
+            for (int j = 0; j < i; j++)
+            {
+                if (d[i][j] > d[i][k] + d[k][j])
+                {
+                    d[i][j] = d[i][k] + d[k][j];
+                    d[j][i] = d[i][j];
+                }
+            }
+        }
+    }
+    for (int i = 0; i < p; i++)
+    {
+        int sum = 0;
+        for (int j = 0; j < p; j++)
+        {
+            sum += d[i][j] * mark[j];
+        }
+        if (res > sum)
+            res = sum;
+    }
+    printf("%d", res);
+    return 0;
+}