Count spanning trees test

adamant-pwn · adamant-pwn · commit 60c8e54706a6 · 2024-07-03T02:54:34.000+02:00
diff --git a/cp-algo/linalg/frobenius.hpp b/cp-algo/linalg/frobenius.hpp
@@ -4,7 +4,7 @@
 #include "matrix.hpp"
 #include <algorithm>
 #include <vector>
-namespace cp_algo::math::linalg {
+namespace cp_algo::linalg {
     enum frobenius_mode {blocks, full};
     template<frobenius_mode mode = blocks>
     auto frobenius_form(auto const& A) {
diff --git a/cp-algo/linalg/matrix.hpp b/cp-algo/linalg/matrix.hpp
@@ -8,7 +8,7 @@
 #include <cassert>
 #include <vector>
 #include <array>
-namespace cp_algo::math::linalg {
+namespace cp_algo::linalg {
     template<typename base_t>
     struct matrix: valarray_base<matrix<base_t>, vec<base_t>> {
         using base = base_t;
diff --git a/cp-algo/linalg/vector.hpp b/cp-algo/linalg/vector.hpp
@@ -8,7 +8,7 @@
 #include <iostream>
 #include <iterator>
 #include <cassert>
-namespace cp_algo::math::linalg {
+namespace cp_algo::linalg {
     template<class vec, typename base>
     struct valarray_base: std::valarray<base> {
         using Base = std::valarray<base>;
@@ -119,7 +119,7 @@ namespace cp_algo::math::linalg {
         using Base::Base;
     };
 
-    template<modint_type base>
+    template<math::modint_type base>
     struct vec<base>: vec_base<vec<base>, base> {
         using Base = vec_base<vec<base>, base>;
         using Base::Base;
diff --git a/verify/linalg/characteristic.test.cpp b/verify/linalg/characteristic.test.cpp
@@ -8,7 +8,7 @@
 
 using namespace std;
 using namespace cp_algo::math;
-using namespace cp_algo::math::linalg;
+using namespace cp_algo::linalg;
 
 const int mod = 998244353;
 using base = modint<mod>;
diff --git a/verify/linalg/det.test.cpp b/verify/linalg/det.test.cpp
@@ -6,7 +6,7 @@
 #include <bits/stdc++.h>
 
 using namespace std;
-using namespace cp_algo::math::linalg;
+using namespace cp_algo::linalg;
 using namespace cp_algo::math;
 
 const int mod = 998244353;
diff --git a/verify/linalg/inv.test.cpp b/verify/linalg/inv.test.cpp
@@ -6,7 +6,7 @@
 #include <bits/stdc++.h>
 
 using namespace std;
-using namespace cp_algo::math::linalg;
+using namespace cp_algo::linalg;
 using namespace cp_algo::math;
 
 const int mod = 998244353;
diff --git a/verify/linalg/pow.test.cpp b/verify/linalg/pow.test.cpp
@@ -6,7 +6,7 @@
 #include <bits/stdc++.h>
 
 using namespace std;
-using namespace cp_algo::math::linalg;
+using namespace cp_algo::linalg;
 using namespace cp_algo::math;
 
 const int mod = 998244353;
diff --git a/verify/linalg/pow_fast.test.cpp b/verify/linalg/pow_fast.test.cpp
@@ -8,7 +8,7 @@
 
 using namespace std;
 using namespace cp_algo::math;
-using namespace cp_algo::math::linalg;
+using namespace cp_algo::linalg;
 
 const int mod = 998244353;
 using base = modint<mod>;
diff --git a/verify/linalg/prod.test.cpp b/verify/linalg/prod.test.cpp
@@ -6,7 +6,7 @@
 #include <bits/stdc++.h>
 
 using namespace std;
-using namespace cp_algo::math::linalg;
+using namespace cp_algo::linalg;
 using namespace cp_algo::math;
 
 const int mod = 998244353;
diff --git a/verify/linalg/prod_dynamic_modint.test.cpp b/verify/linalg/prod_dynamic_modint.test.cpp
@@ -6,7 +6,7 @@
 #include <bits/stdc++.h>
 
 using namespace std;
-using namespace cp_algo::math::linalg;
+using namespace cp_algo::linalg;
 using namespace cp_algo::math;
 using base = dynamic_modint;
 
diff --git a/verify/linalg/rank.test.cpp b/verify/linalg/rank.test.cpp
@@ -7,7 +7,7 @@
 
 using namespace std;
 using namespace cp_algo::math;
-using namespace cp_algo::math::linalg;
+using namespace cp_algo::linalg;
 
 const int mod = 998244353;
 using base = modint<mod>;
diff --git a/verify/linalg/spanning_directed.test.cpp b/verify/linalg/spanning_directed.test.cpp
@@ -0,0 +1,41 @@
+// @brief Counting Spanning Trees (Directed)
+#define PROBLEM "https://judge.yosupo.jp/problem/counting_spanning_tree_directed"
+#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC target("tune=native")
+#include "cp-algo/linalg/matrix.hpp"
+#include <bits/stdc++.h>
+
+using namespace std;
+using namespace cp_algo::math;
+using namespace cp_algo::linalg;
+
+const int mod = 998244353;
+using base = modint<mod>;
+
+void solve() {
+    int n, m, r;
+    cin >> n >> m >> r;
+    matrix<base> a(n);
+    for(int i = 0; i < m; i++) {
+        int u, v;
+        cin >> u >> v;
+        a[u][v] -= 1;
+        a[v][v] += 1;
+    }
+    for(int i = 0; i < n; i++) {
+        a[r][i] = a[i][r] = 0;
+    }
+    a[r][r] = 1;
+    cout << a.det() << "\n";
+}
+
+signed main() {
+    //freopen("input.txt", "r", stdin);
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    int t = 1;
+    // cin >> t;
+    while(t--) {
+        solve();
+    }
+}
diff --git a/verify/linalg/spanning_undirected.test.cpp b/verify/linalg/spanning_undirected.test.cpp
@@ -0,0 +1,43 @@
+// @brief Counting Spanning Trees (Undirected)
+#define PROBLEM "https://judge.yosupo.jp/problem/counting_spanning_tree_undirected"
+#pragma GCC optimize("Ofast,unroll-loops")
+#pragma GCC target("tune=native")
+#include "cp-algo/linalg/matrix.hpp"
+#include <bits/stdc++.h>
+
+using namespace std;
+using namespace cp_algo::math;
+using namespace cp_algo::linalg;
+
+const int mod = 998244353;
+using base = modint<mod>;
+
+void solve() {
+    int n, m;
+    cin >> n >> m;
+    matrix<base> a(n);
+    for(int i = 0; i < m; i++) {
+        int u, v;
+        cin >> u >> v;
+        a[u][v] -= 1;
+        a[v][u] -= 1;
+        a[v][v] += 1;
+        a[u][u] += 1;
+    }
+    for(int i = 0; i < n; i++) {
+        a[0][i] = a[i][0] = 0;
+    }
+    a[0][0] = 1;
+    cout << a.det() << "\n";
+}
+
+signed main() {
+    //freopen("input.txt", "r", stdin);
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    int t = 1;
+    // cin >> t;
+    while(t--) {
+        solve();
+    }
+}
diff --git a/verify/linalg/system.test.cpp b/verify/linalg/system.test.cpp
@@ -6,7 +6,7 @@
 #include <bits/stdc++.h>
 
 using namespace std;
-using namespace cp_algo::math::linalg;
+using namespace cp_algo::linalg;
 using namespace cp_algo::math;
 
 const int mod = 998244353;
