結果
問題 | No.1340 おーじ君をさがせ |
ユーザー | firiexp |
提出日時 | 2021-01-15 21:59:53 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,324 bytes |
コンパイル時間 | 748 ms |
コンパイル使用メモリ | 92,124 KB |
最終ジャッジ日時 | 2024-04-27 03:33:37 |
合計ジャッジ時間 | 1,243 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of 'struct SquareMatrix<SemiRing, 100>': main.cpp:111:9: required from here main.cpp:24:9: error: 'SquareMatrix<H, SIZE>::A' has incomplete type 24 | mat A; | ^ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_map.h:63, from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/map:61, from main.cpp:3: /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/tuple:1595:45: note: declaration of 'using mat = struct std::array<std::array<bool, 100>, 100>' {aka 'struct std::array<std::array<bool, 100>, 100>'} 1595 | template<typename _Tp, size_t _Nm> struct array; | ^~~~~ main.cpp: In function 'int main()': main.cpp:115:13: error: no match for 'operator[]' (operand types are 'SquareMatrix<SemiRing, 100>::ar' {aka 'std::array<bool, 100>'} and 'int') 115 | X[a][b] = true; | ^ main.cpp:117:8: error: variable 'ar p' has initializer but incomplete type 117 | ar p{}; | ^
ソースコード
#include <iostream> #include <algorithm> #include <map> #include <set> #include <queue> #include <stack> #include <numeric> #include <bitset> #include <cmath> static const int MOD = 1000000007; using ll = long long; using u32 = unsigned; using u64 = unsigned long long; using namespace std; template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; template<class H, size_t SIZE> struct SquareMatrix { using T = typename H::T; using ar = array<T, SIZE>; using mat = array<ar, SIZE>; mat A; SquareMatrix() = default; static SquareMatrix I(){ SquareMatrix X{}; for (int i = 0; i < SIZE; ++i) { for (int j = 0; j < SIZE; ++j) { if(i == j) X[i][j] = H::one(); else X[i][j] = H::zero(); } } return X; } friend ar operator*=(ar &x, const SquareMatrix &Y) { ar ans{}; for (int i = 0; i < SIZE; ++i) { for (int j = 0; j < SIZE; ++j) { H::add(ans[j], H::mul(x[i], Y[i][j])); } } x.swap(ans); return x; } friend ar operator*(ar x, const SquareMatrix &Y) { return x *= Y; } inline const ar &operator[](int k) const{ return (A.at(k)); } inline ar &operator[](int k) { return (A.at(k)); } SquareMatrix &operator+= (const SquareMatrix &B){ for (int i = 0; i < SIZE; ++i) { for (int j = 0; j < SIZE; ++j) { H::add((*this)[i][j], B[i][j]); } } return (*this); } SquareMatrix &operator-= (const SquareMatrix &B){ for (int i = 0; i < SIZE; ++i) { for (int j = 0; j < SIZE; ++j) { H::add((*this)[i][j], -B[i][j]); } } return (*this); } SquareMatrix &operator*=(const SquareMatrix &B) { SquareMatrix C{}; for (int i = 0; i < SIZE; ++i) { for (int k = 0; k < SIZE; ++k) { for (int j = 0; j < SIZE; ++j) { H::add(C[i][j], H::mul((*this)[i][k], B[k][j])); } } } A.swap(C.A); return (*this); } SquareMatrix pow(ll n) const { SquareMatrix a = (*this), res = I(); while(n > 0){ if(n & 1) res *= a; a *= a; n >>= 1; } return res; } SquareMatrix operator+(const SquareMatrix &B) const {return SquareMatrix(*this) += B;} SquareMatrix operator-(const SquareMatrix &B) const {return SquareMatrix(*this) -= B;} SquareMatrix operator*(const SquareMatrix &B) const {return SquareMatrix(*this) *= B;} }; struct SemiRing { using T = bool; static inline T mul(T x, T y){ return x&y; } static inline void add(T &x, T y){ x |= y; } static inline T one(){ return true; } static inline T zero(){ return false; } }; using ar = array<SemiRing::T, 100>; using mat = SquareMatrix<SemiRing, 100>; int main() { int n, m, t; cin >> n >> m >> t; mat X; for (int i = 0; i < m; ++i) { int a, b; scanf("%d %d", &a, &b); X[a][b] = true; } ar p{}; p[0] = true; p *= X.pow(t); int ans = 0; for (int i = 0; i < n; ++i) { ans += p[i]; } cout << ans << "\n"; return 0; }