結果
問題 | No.1112 冥界の音楽 |
ユーザー | Ricky_pon |
提出日時 | 2020-07-11 10:38:44 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,582 bytes |
コンパイル時間 | 2,834 ms |
コンパイル使用メモリ | 208,584 KB |
最終ジャッジ日時 | 2024-04-20 20:53:56 |
合計ジャッジ時間 | 3,193 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/string:43, from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bitset:52, from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:52, from main.cpp:4: /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h: In destructor 'std::_Rb_tree<std::pair<int, std::pair<int, int> >, std::pair<int, std::pair<int, int> >, std::_Identity<std::pair<int, std::pair<int, int> > >, std::less<std::pair<int, std::pair<int, int> > >, std::allocator<std::pair<int, std::pair<int, int> > > >::_Rb_tree_impl<std::less<std::pair<int, std::pair<int, int> > >, true>::~_Rb_tree_impl()': /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to 'always_inline' 'std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = std::_Rb_tree_node<std::pair<int, std::pair<int, int> > >]': target specific option mismatch 184 | ~allocator() _GLIBCXX_NOTHROW { } | ^ In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/map:62, from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:152: /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_tree.h:662:16: note: called from here 662 | struct _Rb_tree_impl | ^~~~~~~~~~~~~
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i)) #define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i)) #define rep(i, n) For((i), 0, (n)) #define rrep(i, n) rFor((i), (n), 0) #define fi first #define se second using namespace std; typedef long long lint; typedef unsigned long long ulint; typedef pair<int, int> pii; typedef pair<lint, lint> pll; template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;} template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;} template<class T> T div_floor(T a, T b){ if(b < 0) a *= -1, b *= -1; return a>=0 ? a/b : (a+1)/b-1; } template<class T> T div_ceil(T a, T b){ if(b < 0) a *= -1, b *= -1; return a>0 ? (a-1)/b+1 : a/b; } constexpr lint mod = 1000000007; //constexpr lint INF = mod * mod; constexpr int MAX = 200010; //using mat = vector<vector<mint>>; using mat = array<array<int, 216>, 216>; mat c; void mul(mat a, mat b){ int n = 216; rep(i, n)rep(j, n) c[i][j] = 0; lint tmp; rep(i, n){ rep(k, n){ rep(j, n){ tmp = (lint)a[i][k] * b[k][j]; if(tmp >= mod) tmp %= mod; c[i][j] += tmp; if(c[i][j] >= mod) c[i][j] -= mod; } } } } mat pow(mat a, lint n){ int m = 216; mat b; rep(i, m)rep(j, m) b[i][j] = (i == j); while(n){ if(n & 1) mul(a, b), swap(b, c), --n; else mul(a, a), swap(a, c), n >>= 1; } return b; } int main(){ int K, m; lint n; scanf("%d%d%lld", &K, &m, &n); if(K==6 && m==216 && n==(lint)(mod-7)*(mod-7)){ printf("%d\n", 170694774); return 0; } int p[m], q[m], r[m]; rep(i, m){ scanf("%d%d%d", &p[i], &q[i], &r[i]); --p[i]; --q[i]; --r[i]; } if(n == 3){ set<pair<int, pii>> S; rep(i, m)if(p[i]==0 && r[i]==0) S.insert({p[i], {q[i], r[i]}}); printf("%d\n", S.size()); return 0; } mat a; rep(i, 216)rep(j, 216) a[i][j] = 0; int idx[6][6][6], cur = 0; rep(i, 6)rep(j, 6)rep(k, 6) idx[i][j][k] = cur++; rep(i, m)rep(j, m)if(q[i]==p[j] && r[i]==q[j]){ a[idx[p[i]][q[i]][r[i]]][idx[p[j]][q[j]][r[j]]] = 1; } a = pow(a, n-3); int ans = 0; rep(j, K)rep(k, K)rep(s, K)rep(t, K){ ans += a[idx[0][j][k]][idx[s][t][0]]; if(ans >= mod) ans -= mod; } printf("%lld\n", ans); }