add complete graph testcase to minimum_spanning_tree problem

Author: Misuki743

graph/minimum_spanning_tree/gen/complete_max.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include "random.h"
+#include "../params.h"
+
+using namespace std;
+
+struct E {
+    int from, to, cost;
+};
+
+int main(int, char *argv[]) {
+    long long seed = atoll(argv[1]);
+    auto gen = Random(seed);
+
+    int n = 0;
+    while((n + 1) * n / 2 <= N_MAX) {
+        n++;
+    }
+    int m = n * (n - 1) / 2;
+
+    vector<E> edges;
+    for (int u = 1; u < n; u++) {
+        for (int v = 0; v < u; v++) {
+            int c = gen.uniform(0LL, C_MAX);
+            edges.push_back({u, v, c});
+        }
+    }
+
+    auto idx = gen.perm<int>(n);
+    printf("%d %d\n", n, m);
+    for (auto e : edges) {
+        printf("%d %d %d\n", idx[e.from], idx[e.to], e.cost);
+    }
+
+    return 0;
+}

graph/minimum_spanning_tree/gen/complete_random.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include "random.h"
+#include "../params.h"
+
+using namespace std;
+
+struct E {
+    int from, to, cost;
+};
+
+int main(int, char *argv[]) {
+    long long seed = atoll(argv[1]);
+    auto gen = Random(seed);
+
+    int n = (1 << (5 + seed % 5));
+    int m = n * (n - 1) / 2;
+
+    vector<E> edges;
+    for (int u = 1; u < n; u++) {
+        for (int v = 0; v < u; v++) {
+            int c = gen.uniform(0LL, C_MAX);
+            edges.push_back({u, v, c});
+        }
+    }
+
+    auto idx = gen.perm<int>(n);
+    printf("%d %d\n", n, m);
+    for (auto e : edges) {
+        printf("%d %d %d\n", idx[e.from], idx[e.to], e.cost);
+    }
+
+    return 0;
+}

graph/minimum_spanning_tree/hash.json

@@ -1,4 +1,18 @@
 {
+  "complete_max_00.in": "98d76e11baaaecb5b1693f5d09b7f4de59e2dd1189005144e51e0e312db38c2b",
+  "complete_max_00.out": "8e895212b1cd76b6054c07570613b685a2ea3048d534fb860516c87a35f6ff0d",
+  "complete_max_01.in": "8c0132f43d948e38ee2d3a8a0d1092e05be72f358b482ef3ed72b9548c9f59b3",
+  "complete_max_01.out": "78f00461d124c4f1807d4f291fe6c4cd4bd45d9b7f85caf2bba2c8b1f5a8935e",
+  "complete_random_00.in": "238b4b4839d83c1bfccbba6de38f3f84d127a013bc23a415506b1a7e5b96cc9f",
+  "complete_random_00.out": "0abdaf94dfeb432d59b58d340133ea42acafba84bf06b7afcfc5a0a001104051",
+  "complete_random_01.in": "97067b16752169b3d87e1d81630003e9a2f041225805f2518d973c69b3ad7e0b",
+  "complete_random_01.out": "f2e7807e4a96eeb6850377f9a0f68b75a4ea1c16717f507584ed3082c1136fb0",
+  "complete_random_02.in": "c3be8557ba1588ceeb0d3ff33bc52bd199825de879a7e303f0cc2870229abbd6",
+  "complete_random_02.out": "1076b7e5b2e80c5eefab7b389f2f7329ef4b19945bb2280c8dea6014c1bf45aa",
+  "complete_random_03.in": "6d713e4b8fbf8756cf529dd98da0165a9516c7c7266b9190087ebbe0cc151f97",
+  "complete_random_03.out": "c87c472d876ce6438aff1bbd05696439cae53ef91838dfa852c89aef4130eed4",
+  "complete_random_04.in": "3a8aff5752e42d896b6dccf814dfbd6cc88731365d00d5e48c12f5bf83f3939e",
+  "complete_random_04.out": "e4bb50738c8a9497bbc5e830e941747ec6b0bc7ef8a9d8a6f3b7e4a3b3ee3a8f",
   "example_00.in": "020c548c74d1ad61da527d9dd149e5510cba1a30459fe3f933b6ec0b742f87d0",
   "example_00.out": "ad3c92a1dec31cb7cb05f6f2dfd5c7a1517f73b86a3c7cc1b131a17c0c01dd84",
   "example_01.in": "4859c57ba64d8088c41b77c192a9535ac0682e0e478848d9a8fd238a2c4b7691",

graph/minimum_spanning_tree/info.toml

@@ -20,6 +20,12 @@ forum = "https://github.com/yosupo06/library-checker-problems/issues/953"
 [[tests]]
     name = "star.cpp"
     number = 1
+[[tests]]
+    name = "complete_random.cpp"
+    number = 5
+[[tests]]
+    name = "complete_max.cpp"
+    number = 2
 
 [params]
     N_MAX = 500_000