#604944 (C++17) No.1340 おーじ君をさがせ

提出ソース

結果

問題	No.1340 おーじ君をさがせ
ユーザー	iiljj
提出日時	2021-01-16 01:44:53
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	186 ms / 2,000 ms
コード長	10,883 bytes
コンパイル時間	1,890 ms
コンパイル使用メモリ	205,888 KB
実行使用メモリ	5,248 KB
最終ジャッジ日時	2024-11-27 23:26:16
合計ジャッジ時間	5,664 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	1 ms 5,248 KB
testcase_03	AC	2 ms 5,248 KB
testcase_04	AC	2 ms 5,248 KB
testcase_05	AC	2 ms 5,248 KB
testcase_06	AC	2 ms 5,248 KB
testcase_07	AC	2 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	34 ms 5,248 KB
testcase_12	AC	7 ms 5,248 KB
testcase_13	AC	26 ms 5,248 KB
testcase_14	AC	64 ms 5,248 KB
testcase_15	AC	56 ms 5,248 KB
testcase_16	AC	6 ms 5,248 KB
testcase_17	AC	19 ms 5,248 KB
testcase_18	AC	33 ms 5,248 KB
testcase_19	AC	3 ms 5,248 KB
testcase_20	AC	2 ms 5,248 KB
testcase_21	AC	38 ms 5,248 KB
testcase_22	AC	97 ms 5,248 KB
testcase_23	AC	39 ms 5,248 KB
testcase_24	AC	183 ms 5,248 KB
testcase_25	AC	7 ms 5,248 KB
testcase_26	AC	4 ms 5,248 KB
testcase_27	AC	4 ms 5,248 KB
testcase_28	AC	7 ms 5,248 KB
testcase_29	AC	3 ms 5,248 KB
testcase_30	AC	41 ms 5,248 KB
testcase_31	AC	186 ms 5,248 KB
testcase_32	AC	157 ms 5,248 KB
testcase_33	AC	158 ms 5,248 KB
testcase_34	AC	149 ms 5,248 KB
testcase_35	AC	183 ms 5,248 KB
testcase_36	AC	2 ms 5,248 KB
testcase_37	AC	3 ms 5,248 KB
testcase_38	AC	171 ms 5,248 KB
testcase_39	AC	48 ms 5,248 KB
testcase_40	AC	48 ms 5,248 KB
testcase_41	AC	48 ms 5,248 KB
testcase_42	AC	2 ms 5,248 KB
testcase_43	AC	2 ms 5,248 KB
testcase_44	AC	2 ms 5,248 KB
testcase_45	AC	2 ms 5,248 KB
testcase_46	AC	38 ms 5,248 KB
testcase_47	AC	39 ms 5,248 KB
testcase_48	AC	43 ms 5,248 KB
testcase_49	AC	45 ms 5,248 KB
testcase_50	AC	44 ms 5,248 KB
testcase_51	AC	44 ms 5,248 KB
testcase_52	AC	75 ms 5,248 KB
testcase_53	AC	75 ms 5,248 KB
testcase_54	AC	78 ms 5,248 KB
testcase_55	AC	59 ms 5,248 KB
testcase_56	AC	2 ms 5,248 KB
testcase_57	AC	2 ms 5,248 KB
testcase_58	AC	2 ms 5,248 KB
testcase_59	AC	25 ms 5,248 KB
testcase_60	AC	2 ms 5,248 KB
testcase_61	AC	23 ms 5,248 KB

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

ソースコード

raw source code

/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region BitsetMatrix */

template <size_t HMAX = 510, size_t WMAX = 510> struct BitsetMatrix : public array<bitset<WMAX>, HMAX> {
    int h, w;
    BitsetMatrix(size_t h = 1, size_t w = 1) : h(h), w(w) {
        assert(h <= HMAX);
        assert(w <= WMAX);
    }
    // BitsetMatrix(const BitsetMatrix<HMAX, WMAX> &mt) : array<bitset<WMAX>, HMAX>(mt), h(mt.h), w(mt.w) {}

    BitsetMatrix<HMAX, WMAX> &operator+=(const BitsetMatrix<HMAX, WMAX> &another) {
        assert(h == another.h);
        assert(w == another.w);
        REP(i, 0, h)(*this)[i] |= another[i];
        return *this;
    }
    BitsetMatrix<HMAX, WMAX> &operator|=(const BitsetMatrix<HMAX, WMAX> &another) {
        assert(h == another.h);
        assert(w == another.w);
        REP(i, 0, h)(*this)[i] |= another[i];
        return *this;
    }

    BitsetMatrix<HMAX, WMAX> &operator*=(const BitsetMatrix<HMAX, WMAX> &another) {
        assert(w == another.h);
        BitsetMatrix<HMAX, WMAX> ret(this->h, another.w);
        REP(i, 0, this->h) REP(j, 0, another.w) REP(k, 0, this->w) {
            ret[i][j] = ret[i][j] | ((*this)[i][k] & another[k][j]);
        }
        *this = ret;
        return *this;
    }
    BitsetMatrix<HMAX, WMAX> &operator&=(const BitsetMatrix<HMAX, WMAX> &another) {
        assert(w == another.h);
        BitsetMatrix<HMAX, WMAX> ret(this->h, another.w);
        REP(i, 0, this->h) REP(j, 0, another.w) REP(k, 0, this->w) {
            ret[i][j] = ret[i][j] | ((*this)[i][k] & another[k][j]);
        }
        *this = ret;
        return *this;
    }

    // 行列に別の行列を足す
    BitsetMatrix<HMAX, WMAX> operator+(const BitsetMatrix<HMAX, WMAX> &another) const {
        BitsetMatrix<HMAX, WMAX> ret(*this);
        return ret += another;
    }
    // 行列に別の行列を足す
    BitsetMatrix<HMAX, WMAX> operator|(const BitsetMatrix<HMAX, WMAX> &another) const {
        BitsetMatrix<HMAX, WMAX> ret(*this);
        return ret += another;
    }

    // 行列に別の行列を右から掛ける
    BitsetMatrix<HMAX, WMAX> operator*(const BitsetMatrix<HMAX, WMAX> &another) const {
        BitsetMatrix<HMAX, WMAX> ret(*this);
        return ret *= another;
    }
    // 行列に別の行列を右から掛ける
    BitsetMatrix<HMAX, WMAX> operator&(const BitsetMatrix<HMAX, WMAX> &another) const {
        BitsetMatrix<HMAX, WMAX> ret(*this);
        return ret *= another;
    }

    // 行列の n 乗を計算する
    BitsetMatrix<HMAX, WMAX> pow(ll n) const {
        assert(this->h == this->w);
        BitsetMatrix<HMAX, WMAX> ret(this->h, this->w);
        BitsetMatrix<HMAX, WMAX> a(*this);
        REP(i, 0, this->h) ret[i][i] = 1;
        while (n) {
            if (n & 1) ret = a * ret;
            a = a * a, n >>= 1;
        }
        return ret;
    }

    // 掃き出し法
    size_t gauss_jordan(size_t width = 0) {
        if (width == 0) width = w;
        size_t _rank = 0;
        REP(col, 0, width) {
            int pivot = -1;
            REP(row, _rank, h) if ((*this)[row][col]) {
                pivot = row;
                break;
            }
            if (pivot == -1) continue;
            swap((*this)[pivot], (*this)[_rank]);
            REP(row, 0, h) {
                if (row != (ll)_rank && (*this)[row][col]) (*this)[row] ^= (*this)[_rank];
            }
            ++_rank;
        }
        return _rank;
    }
};

/* #endregion */

// Problem
void solve() {
    VAR(ll, n, m, t); //
    vll a(m), b(m);
    REP(i, 0, m) cin >> a[i] >> b[i];

    using mat = BitsetMatrix<100, 100>;
    mat mt(n, n);
    REP(i, 0, m) mt[b[i]][a[i]] = 1;

    mat init(n, 1);
    init[0][0] = 1;

    mat ans = mt.pow(t) * init;
    // mt.print();

    ll cnt = 0;
    REP(i, 0, n) cnt += ans[i][0];
    pprint(cnt);
}

// entry point
int main() {
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード