結果
問題 | No.1340 おーじ君をさがせ |
ユーザー | ei1333333 |
提出日時 | 2021-01-15 22:33:59 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 115 ms / 2,000 ms |
コード長 | 4,502 bytes |
コンパイル時間 | 2,441 ms |
コンパイル使用メモリ | 202,880 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-05 21:50:18 |
合計ジャッジ時間 | 6,717 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 9 ms
5,248 KB |
testcase_01 | AC | 7 ms
5,376 KB |
testcase_02 | AC | 8 ms
5,376 KB |
testcase_03 | AC | 11 ms
5,376 KB |
testcase_04 | AC | 7 ms
5,376 KB |
testcase_05 | AC | 6 ms
5,376 KB |
testcase_06 | AC | 5 ms
5,376 KB |
testcase_07 | AC | 9 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 4 ms
5,376 KB |
testcase_10 | AC | 95 ms
5,376 KB |
testcase_11 | AC | 56 ms
5,376 KB |
testcase_12 | AC | 51 ms
5,376 KB |
testcase_13 | AC | 50 ms
5,376 KB |
testcase_14 | AC | 47 ms
5,376 KB |
testcase_15 | AC | 51 ms
5,376 KB |
testcase_16 | AC | 52 ms
5,376 KB |
testcase_17 | AC | 53 ms
5,376 KB |
testcase_18 | AC | 48 ms
5,376 KB |
testcase_19 | AC | 55 ms
5,376 KB |
testcase_20 | AC | 48 ms
5,376 KB |
testcase_21 | AC | 97 ms
5,376 KB |
testcase_22 | AC | 97 ms
5,376 KB |
testcase_23 | AC | 103 ms
5,376 KB |
testcase_24 | AC | 101 ms
5,376 KB |
testcase_25 | AC | 115 ms
5,376 KB |
testcase_26 | AC | 103 ms
5,376 KB |
testcase_27 | AC | 104 ms
5,376 KB |
testcase_28 | AC | 90 ms
5,376 KB |
testcase_29 | AC | 102 ms
5,376 KB |
testcase_30 | AC | 97 ms
5,376 KB |
testcase_31 | AC | 99 ms
5,376 KB |
testcase_32 | AC | 95 ms
5,376 KB |
testcase_33 | AC | 92 ms
5,376 KB |
testcase_34 | AC | 87 ms
5,376 KB |
testcase_35 | AC | 109 ms
5,376 KB |
testcase_36 | AC | 95 ms
5,376 KB |
testcase_37 | AC | 95 ms
5,376 KB |
testcase_38 | AC | 95 ms
5,376 KB |
testcase_39 | AC | 27 ms
5,376 KB |
testcase_40 | AC | 28 ms
5,376 KB |
testcase_41 | AC | 28 ms
5,376 KB |
testcase_42 | AC | 7 ms
5,376 KB |
testcase_43 | AC | 5 ms
5,376 KB |
testcase_44 | AC | 49 ms
5,376 KB |
testcase_45 | AC | 19 ms
5,376 KB |
testcase_46 | AC | 21 ms
5,376 KB |
testcase_47 | AC | 21 ms
5,376 KB |
testcase_48 | AC | 23 ms
5,376 KB |
testcase_49 | AC | 23 ms
5,376 KB |
testcase_50 | AC | 22 ms
5,376 KB |
testcase_51 | AC | 24 ms
5,376 KB |
testcase_52 | AC | 43 ms
5,376 KB |
testcase_53 | AC | 42 ms
5,376 KB |
testcase_54 | AC | 42 ms
5,376 KB |
testcase_55 | AC | 32 ms
5,376 KB |
testcase_56 | AC | 50 ms
5,376 KB |
testcase_57 | AC | 50 ms
5,376 KB |
testcase_58 | AC | 52 ms
5,376 KB |
testcase_59 | AC | 14 ms
5,376 KB |
testcase_60 | AC | 2 ms
5,376 KB |
testcase_61 | AC | 13 ms
5,376 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; using int64 = long long; const int mod = 1e9 + 7; //const int mod = 998244353; const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } template< typename F > struct FixPoint : F { FixPoint(F &&f) : F(forward< F >(f)) {} template< typename... Args > decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, forward< Args >(args)...); } }; template< typename F > inline decltype(auto) MFP(F &&f) { return FixPoint< F >{forward< F >(f)}; } /** * @brief Square-Matrix(正方行列) */ template< class T, size_t N > struct SquareMatrix { array< array< T, N >, N > A; SquareMatrix() = default; size_t size() { return N; } inline const array< T, N > &operator[](int k) const { return (A.at(k)); } inline array< T, N > &operator[](int k) { return (A.at(k)); } static SquareMatrix add_identity() { return SquareMatrix(); } static SquareMatrix mul_identity() { SquareMatrix mat; for(size_t i = 0; i < N; i++) mat[i][i] = 1; return mat; } SquareMatrix &operator+=(const SquareMatrix &B) { for(size_t i = 0; i < N; i++) { for(size_t j = 0; j < N; j++) { (*this)[i][j] += B[i][j]; } } return *this; } SquareMatrix &operator-=(const SquareMatrix &B) { for(size_t i = 0; i < N; i++) { for(size_t j = 0; j < N; j++) { (*this)[i][j] -= B[i][j]; } } return *this; } SquareMatrix &operator*=(const SquareMatrix &B) { array< array< T, N >, N > C; for(size_t i = 0; i < N; i++) { for(size_t j = 0; j < N; j++) { C[i][j] = 0; for(size_t k = 0; k < N; k++) { C[i][j] = (C[i][j] + (*this)[i][k] * B[k][j]); chmin(C[i][j], 1); } } } A.swap(C); return (*this); } SquareMatrix &operator^=(uint64_t k) { SquareMatrix B = SquareMatrix::mul_identity(); while(k > 0) { if(k & 1) B *= *this; *this *= *this; k >>= 1LL; } A.swap(B.A); return *this; } 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; } SquareMatrix operator^(uint64_t k) const { return SquareMatrix(*this) ^= k; } friend ostream &operator<<(ostream &os, SquareMatrix &p) { for(int i = 0; i < N; i++) { os << "["; for(int j = 0; j < N; j++) { os << p[i][j] << (j + 1 == N ? "]\n" : ","); } } return os; } }; int main() { int N, M; int64 T; cin >> N >> M >> T; auto mat = SquareMatrix< int, 100 >::add_identity(); for(int i = 0; i < M; i++) { int a, b; cin >> a >> b; mat[a][b] = 1; } mat ^= T; int ret = 0; for(int i = 0; i < N; i++) { ret += mat[0][i]; } cout << ret << "\n"; }