#704966 (C++17(clang)) No.1774 Love Triangle (Hard)

提出ソース

結果

問題	No.1774 Love Triangle (Hard)
ユーザー	hitonanode
提出日時	2021-10-08 01:15:55
言語	C++17(clang) (17.0.6 + boost 1.83.0)
結果	AC
実行時間	3,645 ms / 8,000 ms
コード長	5,330 bytes
コンパイル時間	4,669 ms
コンパイル使用メモリ	150,260 KB
実行使用メモリ	10,368 KB
最終ジャッジ日時	2024-12-16 03:57:49
合計ジャッジ時間	257,333 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	1 ms 5,248 KB
testcase_02	AC	3 ms 5,248 KB
testcase_03	AC	5 ms 5,248 KB
testcase_04	AC	3 ms 5,248 KB
testcase_05	AC	4 ms 5,248 KB
testcase_06	AC	2 ms 5,248 KB
testcase_07	AC	9 ms 5,248 KB
testcase_08	AC	2 ms 5,248 KB
testcase_09	AC	2 ms 5,248 KB
testcase_10	AC	2 ms 5,248 KB
testcase_11	AC	14 ms 5,248 KB
testcase_12	AC	2,008 ms 7,936 KB
testcase_13	AC	1,137 ms 6,676 KB
testcase_14	AC	77 ms 5,248 KB
testcase_15	AC	856 ms 6,144 KB
testcase_16	AC	288 ms 5,248 KB
testcase_17	AC	17 ms 5,248 KB
testcase_18	AC	1,027 ms 6,400 KB
testcase_19	AC	36 ms 5,248 KB
testcase_20	AC	85 ms 5,248 KB
testcase_21	AC	51 ms 5,248 KB
testcase_22	AC	3,302 ms 9,880 KB
testcase_23	AC	3,461 ms 9,984 KB
testcase_24	AC	3,491 ms 10,128 KB
testcase_25	AC	3,420 ms 10,112 KB
testcase_26	AC	3,640 ms 10,268 KB
testcase_27	AC	3,414 ms 9,984 KB
testcase_28	AC	3,352 ms 9,984 KB
testcase_29	AC	3,425 ms 10,012 KB
testcase_30	AC	3,475 ms 10,112 KB
testcase_31	AC	3,386 ms 10,008 KB
testcase_32	AC	3,392 ms 10,128 KB
testcase_33	AC	3,420 ms 10,128 KB
testcase_34	AC	3,379 ms 10,140 KB
testcase_35	AC	3,403 ms 10,276 KB
testcase_36	AC	3,295 ms 9,884 KB
testcase_37	AC	3,488 ms 10,024 KB
testcase_38	AC	3,372 ms 10,112 KB
testcase_39	AC	3,383 ms 9,984 KB
testcase_40	AC	3,439 ms 10,132 KB
testcase_41	AC	3,623 ms 10,152 KB
testcase_42	AC	3,485 ms 10,240 KB
testcase_43	AC	3,457 ms 10,240 KB
testcase_44	AC	3,488 ms 10,240 KB
testcase_45	AC	3,446 ms 10,112 KB
testcase_46	AC	3,470 ms 10,112 KB
testcase_47	AC	3,446 ms 10,212 KB
testcase_48	AC	3,487 ms 10,240 KB
testcase_49	AC	3,535 ms 10,240 KB
testcase_50	AC	3,439 ms 10,112 KB
testcase_51	AC	3,486 ms 10,200 KB
testcase_52	AC	3,480 ms 10,240 KB
testcase_53	AC	3,514 ms 10,240 KB
testcase_54	AC	3,549 ms 10,368 KB
testcase_55	AC	3,645 ms 10,240 KB
testcase_56	AC	3,476 ms 10,240 KB
testcase_57	AC	3,501 ms 10,336 KB
testcase_58	AC	3,482 ms 10,340 KB
testcase_59	AC	3,453 ms 10,112 KB
testcase_60	AC	3,482 ms 10,112 KB
testcase_61	AC	3,508 ms 10,128 KB
testcase_62	AC	3,453 ms 10,240 KB
testcase_63	AC	3,455 ms 10,112 KB
testcase_64	AC	3,376 ms 10,112 KB
testcase_65	AC	3,462 ms 10,240 KB
testcase_66	AC	3,485 ms 10,240 KB
testcase_67	AC	3,413 ms 10,048 KB
testcase_68	AC	3,472 ms 10,208 KB
testcase_69	AC	3,421 ms 10,240 KB
testcase_70	AC	3,389 ms 10,112 KB
testcase_71	AC	3,501 ms 10,240 KB
testcase_72	AC	3,446 ms 10,112 KB
testcase_73	AC	3,409 ms 10,240 KB
testcase_74	AC	3,542 ms 10,240 KB
testcase_75	AC	3,507 ms 10,240 KB
testcase_76	AC	3,595 ms 10,120 KB
testcase_77	AC	3,482 ms 10,112 KB
testcase_78	AC	3,466 ms 10,112 KB
testcase_79	AC	3,316 ms 9,888 KB
testcase_80	AC	3,456 ms 10,240 KB
testcase_81	AC	3,484 ms 10,112 KB
testcase_82	AC	3,565 ms 10,236 KB
testcase_83	AC	3,378 ms 9,984 KB
testcase_84	AC	3,284 ms 10,024 KB
testcase_85	AC	3,382 ms 9,920 KB
testcase_86	AC	3,388 ms 10,112 KB
testcase_87	AC	3,425 ms 10,112 KB
testcase_88	AC	3,384 ms 10,112 KB
testcase_89	AC	3,403 ms 9,992 KB
testcase_90	AC	3,410 ms 10,112 KB
testcase_91	AC	3,231 ms 10,004 KB
testcase_92	AC	3,282 ms 10,152 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <algorithm>
#include <cassert>
#include <chrono>
#include <iostream>
#include <numeric>
#include <random>
#include <utility>
#include <vector>
using namespace std;

#include <atcoder/modint>
using mint = atcoder::static_modint<(1 << 30) + 3>;  // prime
// using mint = atcoder::modint1000000007;
std::mt19937 mt(159376);


template <class T>
std::vector<T> mat_vec_mul(const std::vector<std::vector<T>> &mat, const std::vector<T> &vec) {
    int H = mat.size(), W = mat[0].size();
    assert(W == int(vec.size()));
    std::vector<T> ret(H);
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) ret[i] += mat[i][j] * vec[j];
    }
    return ret;
}

// Try to calculate inverse of M and return rank of M (destructive)
template <class T>
int inverse_matrix(std::vector<std::vector<T>> &M) {
    const int N = M.size();
    assert(N and M[0].size() == M.size());
    std::vector<std::vector<T>> ret(N, std::vector<T>(N));
    for (int i = 0; i < N; ++i) ret[i][i] = 1;

    int rank = 0;
    for (int i = 0; i < N; ++i) {
        int ti = i;
        while (ti < N and M[ti][i] == 0) ti++;
        if (ti == N) {
            continue;
        }
        ++rank;
        ret[i].swap(ret[ti]), M[i].swap(M[ti]);
        T inv = T(1) / M[i][i];
        for (int j = 0; j < N; ++j) ret[i][j] *= inv;
        for (int j = i + 1; j < N; ++j) M[i][j] *= inv;
        for (int h = 0; h < N; ++h) {
            if (i == h) continue;
            const T c = -M[h][i];
            for (int j = 0; j < N; ++j) ret[h][j] += ret[i][j] * c;
            for (int j = i + 1; j < N; ++j) M[h][j] += M[i][j] * c;
        }
    }
    M = ret;
    return rank;
}


template <class ModInt>
std::vector<int>
linear_matroid_parity(const std::vector<std::pair<std::vector<ModInt>, std::vector<ModInt>>> &bcs) {
    if (bcs.empty()) return {};
    const int r = bcs[0].first.size(), m = bcs.size(), r2 = (r + 1) / 2;
    std::uniform_int_distribution<int> d(0, ModInt::mod() - 1);

    auto gen_random_vector = [&]() -> std::vector<ModInt> {
        std::vector<ModInt> v(r2 * 2);
        for (int i = 0; i < r2 * 2; i++) v[i] = d(mt);
        return v;
    };

    std::vector<ModInt> x(m);
    std::vector<std::pair<vector<ModInt>, vector<ModInt>>> bcadd(r2);

    std::vector<std::vector<ModInt>> Yinv; // r2 * r2 matrices
    int rankY = -1;
    while (rankY < r2 * 2) {
        Yinv.assign(r2 * 2, std::vector<ModInt>(r2 * 2, 0));
        for (auto &[b, c] : bcadd) {
            b = gen_random_vector(), c = gen_random_vector();
            for (int j = 0; j < r2 * 2; j++) {
                for (int k = 0; k < r2 * 2; k++) Yinv[j][k] += b[j] * c[k] - c[j] * b[k];
            }
        }
        rankY = inverse_matrix(Yinv);
    }

    std::vector<std::vector<ModInt>> tmpmat(r2 * 2, std::vector<ModInt>(r2 * 2));


    std::vector<int> ret(m, -1);
    int additional_dim = bcadd.size();
    for (int i = 0; i < m; i++) {
        {
            x[i] = d(mt);
            auto b = bcs[i].first, c = bcs[i].second;
            b.resize(r2 * 2, 0), c.resize(r2 * 2, 0);
            std::vector<ModInt> Yib = mat_vec_mul(Yinv, b), Yic = mat_vec_mul(Yinv, c);
            ModInt bYic = std::inner_product(b.begin(), b.end(), Yic.begin(), ModInt(0));
            ModInt v = 1 + x[i] * bYic;

            if (v == 0) break; // failed

            const auto coeff = x[i] / v;
            for (int j = 0; j < r2 * 2; j++) {
                for (int k = 0; k < r2 * 2; k++) {
                    tmpmat[j][k] = Yib[j] * Yic[k] - Yic[j] * Yib[k];
                }
            }

            for (int j = 0; j < r2 * 2; j++) {
                for (int k = 0; k < r2 * 2; k++) Yinv[j][k] -= tmpmat[j][k] * coeff;
            }
        }

        if (additional_dim) {
            const auto &[b, c] = bcadd[additional_dim - 1];
            std::vector<ModInt> Yib = mat_vec_mul(Yinv, b), Yic = mat_vec_mul(Yinv, c);
            ModInt bYic = std::inner_product(b.begin(), b.end(), Yic.begin(), ModInt(0));
            const ModInt v = 1 + bYic;
            if (v != 0) {
                // 消しても正則
                additional_dim--;
                const auto coeff = 1 / v;
                for (int j = 0; j < r2 * 2; j++) {
                    for (int k = 0; k < r2 * 2; k++) tmpmat[j][k] = Yib[j] * Yic[k] - Yic[j] * Yib[k];
                }
                for (int j = 0; j < r2 * 2; j++) {
                    for (int k = 0; k < r2 * 2; k++) Yinv[j][k] -= tmpmat[j][k] * coeff;
                }
            }
        }

        ret[i] = r2 - additional_dim;
    }

    return ret;
}

vector<int> solve(int N, vector<pair<pair<int, int>, pair<int, int>>> bcs) {
    vector<pair<vector<mint>, vector<mint>>> vs;
    for (auto [ab, cd] : bcs) {
        auto [a, b] = ab;
        auto [c, d] = cd;
        vector<mint> B(N), C(N);
        B.at(a) += 1;
        B.at(b) -= 1;
        C.at(c) += 1;
        C.at(d) -= 1;
        vs.emplace_back(B, C);
    }

    return linear_matroid_parity<mint>(vs);
}

int main() {
    int N, M;
    cin >> N >> M;
    vector<pair<pair<int, int>, pair<int, int>>> edges;
    while (M--) {
        int u, v, w;
        cin >> u >> v >> w;
        u--, v--, w--;
        edges.push_back({{u, w}, {v, w}});
    }
    auto ret = solve(N, edges);
    for (auto x : ret) cout << x << '\n';
}

yukicoder

結果

テストケース

ソースコード