CP-Algorithms Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub cp-algorithms/cp-algorithms-aux

:heavy_check_mark: Counting Spanning Trees (Directed) (verify/linalg/spanning_directed.test.cpp)

Depends on

Code

// @brief Counting Spanning Trees (Directed)
#define PROBLEM "https://judge.yosupo.jp/problem/counting_spanning_tree_directed"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
//#include "blazingio/blazingio.min.hpp"
#include "cp-algo/math/combinatorics.hpp"
#include "cp-algo/linalg/matrix.hpp"

using namespace std;
using namespace cp_algo::math;
using namespace cp_algo::linalg;

const int64_t 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();
    }
}
Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env Name Status Elapsed Memory
g++ example_00 :heavy_check_mark: AC 6 ms 4 MB
g++ example_01 :heavy_check_mark: AC 5 ms 4 MB
g++ example_02 :heavy_check_mark: AC 5 ms 4 MB
g++ example_03 :heavy_check_mark: AC 5 ms 4 MB
g++ max_00 :heavy_check_mark: AC 70 ms 8 MB
g++ max_01 :heavy_check_mark: AC 71 ms 8 MB
g++ max_02 :heavy_check_mark: AC 76 ms 8 MB
g++ random_00 :heavy_check_mark: AC 47 ms 4 MB
g++ random_01 :heavy_check_mark: AC 47 ms 4 MB
g++ random_02 :heavy_check_mark: AC 37 ms 4 MB
g++ random_03 :heavy_check_mark: AC 9 ms 4 MB
g++ random_04 :heavy_check_mark: AC 15 ms 4 MB
g++ small_00 :heavy_check_mark: AC 6 ms 4 MB
g++ small_01 :heavy_check_mark: AC 5 ms 4 MB
g++ small_02 :heavy_check_mark: AC 6 ms 4 MB
g++ small_03 :heavy_check_mark: AC 5 ms 4 MB
g++ small_04 :heavy_check_mark: AC 5 ms 4 MB
g++ small_05 :heavy_check_mark: AC 6 ms 4 MB
g++ small_06 :heavy_check_mark: AC 6 ms 4 MB
g++ small_07 :heavy_check_mark: AC 6 ms 4 MB
g++ small_08 :heavy_check_mark: AC 6 ms 4 MB
g++ small_09 :heavy_check_mark: AC 6 ms 4 MB
Back to top page