#718268 (C++17) No.1776 Love Triangle 2 (Hard)

提出ソース

結果

問題	No.1776 Love Triangle 2 (Hard)
ユーザー	hitonanode
提出日時	2021-11-20 00:07:24
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	RE (最新) AC (最初)
実行時間	-
コード長	7,887 bytes
コンパイル時間	2,586 ms
コンパイル使用メモリ	150,248 KB
実行使用メモリ	11,520 KB
最終ジャッジ日時	2024-07-02 12:02:11
合計ジャッジ時間	74,423 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	33 ms 5,248 KB
testcase_01	AC	33 ms 5,376 KB
testcase_02	AC	34 ms 5,376 KB
testcase_03	AC	33 ms 5,376 KB
testcase_04	AC	88 ms 5,376 KB
testcase_05	AC	88 ms 5,376 KB
testcase_06	AC	87 ms 5,376 KB
testcase_07	AC	87 ms 5,376 KB
testcase_08	AC	87 ms 5,376 KB
testcase_09	AC	227 ms 5,376 KB
testcase_10	RE	-
testcase_11	AC	140 ms 5,376 KB
testcase_12	AC	119 ms 5,376 KB
testcase_13	RE	-
testcase_14	AC	72 ms 5,376 KB
testcase_15	AC	62 ms 5,376 KB
testcase_16	AC	56 ms 5,376 KB
testcase_17	AC	52 ms 5,376 KB
testcase_18	AC	51 ms 5,376 KB
testcase_19	AC	220 ms 5,376 KB
testcase_20	AC	187 ms 5,376 KB
testcase_21	AC	140 ms 5,376 KB
testcase_22	AC	110 ms 5,376 KB
testcase_23	AC	86 ms 5,376 KB
testcase_24	AC	140 ms 5,376 KB
testcase_25	AC	111 ms 5,376 KB
testcase_26	AC	86 ms 5,376 KB
testcase_27	AC	110 ms 5,376 KB
testcase_28	AC	78 ms 5,376 KB
testcase_29	AC	50 ms 5,376 KB
testcase_30	AC	85 ms 5,376 KB
testcase_31	AC	223 ms 5,376 KB
testcase_32	AC	425 ms 5,376 KB
testcase_33	AC	771 ms 5,376 KB
testcase_34	AC	768 ms 5,376 KB
testcase_35	AC	1,079 ms 5,376 KB
testcase_36	AC	1,519 ms 5,376 KB
testcase_37	AC	2,035 ms 5,376 KB
testcase_38	AC	2,841 ms 5,376 KB
testcase_39	AC	65 ms 5,376 KB
testcase_40	AC	142 ms 5,376 KB
testcase_41	AC	248 ms 5,376 KB
testcase_42	AC	296 ms 5,376 KB
testcase_43	AC	312 ms 5,376 KB
testcase_44	AC	177 ms 5,376 KB
testcase_45	AC	957 ms 5,376 KB
testcase_46	AC	385 ms 5,376 KB
testcase_47	AC	101 ms 5,376 KB
testcase_48	AC	539 ms 5,376 KB
testcase_49	AC	49 ms 5,376 KB
testcase_50	AC	84 ms 5,376 KB
testcase_51	AC	215 ms 5,376 KB
testcase_52	RE	-
testcase_53	AC	794 ms 5,376 KB
testcase_54	RE	-
testcase_55	RE	-
testcase_56	RE	-
testcase_57	RE	-
testcase_58	RE	-
testcase_59	AC	72 ms 5,376 KB
testcase_60	AC	111 ms 5,376 KB
testcase_61	AC	181 ms 5,376 KB
testcase_62	AC	101 ms 5,376 KB
testcase_63	AC	140 ms 5,376 KB
testcase_64	AC	219 ms 5,376 KB
testcase_65	AC	85 ms 5,376 KB
testcase_66	AC	202 ms 5,376 KB
testcase_67	AC	363 ms 5,376 KB
testcase_68	AC	139 ms 5,376 KB
testcase_69	AC	234 ms 6,228 KB
testcase_70	AC	236 ms 5,972 KB
testcase_71	AC	235 ms 6,100 KB
testcase_72	AC	236 ms 6,096 KB
testcase_73	AC	232 ms 6,096 KB
testcase_74	AC	596 ms 6,016 KB
testcase_75	AC	377 ms 6,016 KB
testcase_76	AC	298 ms 6,144 KB
testcase_77	AC	246 ms 6,016 KB
testcase_78	AC	163 ms 6,144 KB
testcase_79	AC	128 ms 5,972 KB
testcase_80	AC	115 ms 6,016 KB
testcase_81	AC	88 ms 6,144 KB
testcase_82	AC	80 ms 6,232 KB
testcase_83	AC	76 ms 6,016 KB
testcase_84	AC	482 ms 6,144 KB
testcase_85	AC	349 ms 5,968 KB
testcase_86	AC	323 ms 6,144 KB
testcase_87	AC	198 ms 6,016 KB
testcase_88	AC	161 ms 5,972 KB
testcase_89	AC	294 ms 6,016 KB
testcase_90	RE	-
testcase_91	AC	160 ms 5,972 KB
testcase_92	AC	221 ms 5,976 KB
testcase_93	AC	143 ms 6,016 KB
testcase_94	AC	72 ms 6,100 KB
testcase_95	AC	220 ms 6,144 KB
testcase_96	AC	710 ms 6,016 KB
testcase_97	AC	1,842 ms 6,232 KB
testcase_98	AC	3,985 ms 6,016 KB
testcase_99	AC	3,997 ms 6,016 KB
testcase_100	AC	6,967 ms 6,016 KB
testcase_101	AC	9,985 ms 6,016 KB
testcase_102	TLE	-
testcase_103	--	-
testcase_104	--	-
testcase_105	--	-
testcase_106	--	-
testcase_107	--	-
testcase_108	--	-
testcase_109	--	-
testcase_110	--	-
testcase_111	--	-
testcase_112	--	-
testcase_113	--	-
testcase_114	--	-
testcase_115	--	-
testcase_116	--	-
testcase_117	--	-
testcase_118	--	-
testcase_119	--	-
testcase_120	--	-
testcase_121	--	-
testcase_122	--	-
testcase_123	--	-
testcase_124	--	-
testcase_125	--	-
testcase_126	--	-
testcase_127	--	-
testcase_128	--	-
testcase_129	--	-
testcase_130	--	-
testcase_131	--	-
testcase_132	--	-
testcase_133	--	-
testcase_134	--	-
testcase_135	--	-
testcase_136	--	-
testcase_137	--	-
testcase_138	--	-
testcase_139	--	-
testcase_140	--	-
testcase_141	--	-
testcase_142	--	-
testcase_143	--	-
testcase_144	--	-
testcase_145	--	-
testcase_146	--	-
testcase_147	--	-
testcase_148	--	-
testcase_149	--	-
testcase_150	--	-
testcase_151	--	-
testcase_152	--	-
testcase_153	--	-
testcase_154	--	-
testcase_155	--	-
testcase_156	--	-
testcase_157	--	-
testcase_158	--	-
testcase_159	--	-
testcase_160	--	-
testcase_161	--	-
testcase_162	--	-
testcase_163	--	-
testcase_164	--	-
testcase_165	--	-
testcase_166	--	-
testcase_167	--	-
testcase_168	--	-
testcase_169	--	-
testcase_170	--	-
testcase_171	--	-
testcase_172	--	-
testcase_173	--	-
testcase_174	--	-
testcase_175	--	-

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

ソースコード

raw source code

// 辞書順最小の探索が誤っているので RE になるのが正しい
#include <array>
#include <chrono>
#include <iostream>
#include <random>
#include <vector>
using namespace std;
// https://epubs.siam.org/doi/10.1137/1.9781611973099.139

// Nimber (64 bit)
// Reference:
// - https://en.wikipedia.org/wiki/Nimber
// - https://kyopro-friends.hatenablog.com/entry/2020/04/07/195850
// - https://judge.yosupo.jp/submission/4542 (implementation idea)
struct Nimber {
    using ull = unsigned long long;
    ull v;
    const static std::array<std::array<unsigned, 256>, 256> small_table;
    const static std::array<std::array<std::array<ull, 256>, 8>, 8> precalc;

    explicit operator bool() const { return v != 0; }
    Nimber(ull val = 0) : v(val) {}
    Nimber operator+(const Nimber &x) const { return Nimber(v ^ x.v); }
    Nimber operator-(const Nimber &x) const { return Nimber(v ^ x.v); }
    Nimber operator-() const { return *this; }
    Nimber &operator+=(const Nimber &x) { return *this = *this + x; }
    Nimber &operator-=(const Nimber &x) { return *this = *this + x; }
    template <class IStream> friend IStream &operator>>(IStream &is, Nimber &x) {
        ull v;
        return is >> v, x = Nimber(v), is;
    }
    template <class OStream> friend OStream &operator<<(OStream &os, const Nimber &x) {
        return os << x.v;
    }
    bool operator==(const Nimber &x) const { return v == x.v; }
    bool operator!=(const Nimber &x) const { return v != x.v; }
    bool operator<(const Nimber &x) const { return v < x.v; }

    static ull _rec(ull x, ull y) {
        if (x == 0 or y == 0) return 0;
        if (x < y) x ^= y, y ^= x, x ^= y; // Make x >= y
        if (y == 1) return x;
        for (int shift = 64 / 2;; shift >>= 1) {
            ull mask = (1ULL << shift) - 1;
            if (y >> shift) {
                ull v00 = _rec(x & mask, y & mask);
                ull v01 = _rec(x & mask, y >> shift);
                ull v10 = _rec(x >> shift, y & mask);
                ull v11 = _rec(x >> shift, y >> shift);
                return v00 ^ ((v01 ^ v10 ^ v11) << shift) ^ _rec(v11, 1ULL << (shift - 1));
            } else if (x >> shift) {
                return (_rec(x >> shift, y) << shift) ^ _rec(x & mask, y);
            }
        }
    }
    Nimber operator*(const Nimber &x) const {
        if (this->v < 256 and x.v < 256) return small_table[this->v][x.v];
        ull ret = 0;
        for (int d = 0; d < 2; ++d) {  // 16 bit
            for (int e = 0; e < 2; ++e) {  // 16 bit
                ret ^= precalc[d][e][small_table[(v >> (d * 8)) & 255][(x.v >> (e * 8)) & 255]];
            }
        }
        return Nimber(ret);
    }
    Nimber &operator*=(const Nimber &x) { return *this = *this * x; }
};

const std::array<std::array<unsigned, 256>, 256> Nimber::small_table = []() {
    std::array<std::array<unsigned, 256>, 256> ret;
    for (int i = 0; i < 256; ++i) {
        for (int j = 0; j < 256; ++j) ret[i][j] = _rec(i, j);
    }
    return ret;
}();
const std::array<std::array<std::array<unsigned long long, 256>, 8>, 8> Nimber::precalc = []() {
    std::array<std::array<std::array<unsigned long long, 256>, 8>, 8> ret;
    for (int d = 0; d < 8; ++d) {
        for (int e = 0; e < 8; ++e) {
            ull p = _rec(1ULL << (8 * d), 1ULL << (8 * e));
            for (int i = 0; i < 256; ++i) ret[d][e][i] = _rec(p, i);
        }
    }
    return ret;
}();

struct rand_int_ {
    using lint = long long;
    mt19937 mt;
    rand_int_() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
    lint operator()(lint x) { return this->operator()(0, x); } // [0, x)
    lint operator()(lint l, lint r) {
        uniform_int_distribution<lint> d(l, r - 1);
        return d(mt);
    }
} rnd;

template <class Fq>
int can_reach(const vector<vector<Fq>> &w, int x, int y, int z, int dlim) {
    // x を始点に y, z を経由し N に到達する長さ dlim 以下のパスがあるかを判定
    int N = w.size() - 1;
    // dp[visited y][visited z][current v][previous v]
    vector dp(2, vector(2, vector(N + 1, vector<Fq>(N + 1, 0))));
    dp[0][0][N][N] = 1;
    for (int d = 1; d <= dlim; ++d) {
        vector dpnxt(2, vector(2, vector(N + 1, vector<Fq>(N + 1, 0))));
        for (int visy = 0; visy < 2; ++visy) {
            for (int visz = 0; visz < 2; ++visz) {
                for (int now = 0; now <= N; ++now) {
                    Fq sum = 0;
                    for (int prv = 0; prv <= N; ++prv) sum += dp[visy][visz][now][prv];
                    for (int nxt = 0; nxt <= N; ++nxt) {
                        if (visy and (nxt == y)) continue;
                        if (visz and (nxt == z)) continue;
                        Nimber wadd = sum - ((now == y or now == z) ? dp[visy][visz][now][nxt] : 0);
                        dpnxt[visy | (nxt == y)][visz | (nxt == z)][nxt][now] += wadd * w[now][nxt];
                    }
                }
            }
        }
        dp = dpnxt;
        for (int i = 0; i < N; ++i) {
            if (dp[1][1][x][i] != 0) return d;
        }
    }
    return 0;  // not found
}

template <class Fq>
int next_step(const vector<vector<Fq>> &w, int h, int vy, int vz, int y, int z, int D) {
    // h を始点に y, z を経由し N に到達する長さ D のパスの次の一歩
    int N = w.size() - 1;
    // dp[visited y][visited z][current v][previous v]
    vector dp(2, vector(2, vector(N + 1, vector<Fq>(N + 1, 0))));
    dp[0][0][N][N] = 1;
    for (int d = 1; d <= D; ++d) {
        vector dpnxt(2, vector(2, vector(N + 1, vector<Fq>(N + 1, 0))));
        for (int visy = 0; visy < 2; ++visy) {
            for (int visz = 0; visz < 2; ++visz) {
                for (int now = 0; now <= N; ++now) {
                    Fq sum = 0;
                    for (int prv = 0; prv <= N; ++prv) sum += dp[visy][visz][now][prv];
                    for (int nxt = 0; nxt <= N; ++nxt) {
                        if (visy and (nxt == y)) continue;
                        if (visz and (nxt == z)) continue;
                        Nimber wadd = sum - ((now == y or now == z) ? dp[visy][visz][now][nxt] : 0);
                        dpnxt[visy | (nxt == y)][visz | (nxt == z)][nxt][now] += wadd * w[now][nxt];
                    }
                }
            }
        }
        dp = dpnxt;
    }
    for (int i = 0; i < N; ++i) if (dp[vy][vz][h][i]) return i;

    throw;
}

int main() {
    int N, M;
    cin >> N >> M;
    int x, y, z;
    cin >> x >> y >> z;

    --x, --y, --z;
    vector weight(N + 1, vector<Nimber>(N + 1));
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < i; ++j) {
            Nimber w = rnd(1LL << 16);
            Nimber wn = rnd(1LL << 16);
            if (j != x) {
                weight[j][i] = w;
            } else {
                weight[N][i] = wn;
            }
            if (i != x) {
                weight[i][j] = w;
            } else {
                weight[N][j] = wn;
            }
        }
    }
    vector<vector<pair<int, Nimber>>> to(N);

    vector exist_edge(N, vector<int>(N, 1));
    while (M--) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        weight[a][b] = weight[b][a] = 0;
        if (a == x) weight[N][b] = 0;
        if (b == x) weight[N][a] = 0;
    }
    int len = can_reach(weight, x, y, z, N);
    if (!len) {
        puts("-1");
        return 0;
    }
    cout << len << '\n';

    vector<int> path{x};
    int vy = 1, vz = 1;
    for (int l = 1; l < len; ++l) {
        int cur = path.back();
        int ok = next_step(weight, cur, vy, vz, y, z, len - l + 1);
        path.push_back(ok);
        if (y == cur) vy = 0;
        if (z == cur) vz = 0;

        for (int i = 0; i <= N; ++i) {
            weight[cur][i] = weight[i][cur] = 0;
        }
    }

    path.push_back(x);

    for (auto x : path) cout << x + 1 << ' ';
    cout << '\n';
}

yukicoder

結果

テストケース

ソースコード