結果
| 問題 | No.2156 ぞい文字列 |
| ユーザー |
 AngrySadEight
|
| 提出日時 | 2022-12-09 21:44:08 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 4,867 bytes |
| コンパイル時間 | 3,548 ms |
| コンパイル使用メモリ | 237,516 KB |
| 最終ジャッジ日時 | 2024-04-22 21:32:23 |
| 合計ジャッジ時間 | 3,914 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、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:5:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h: In destructor 'std::_Bvector_base<std::allocator<bool> >::_Bvector_impl::~_Bvector_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 = long unsigned int]': target specific option mismatch
184 | ~allocator() _GLIBCXX_NOTHROW { }
| ^
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/vector:67,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/functional:64,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:53:
/home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_bvector.h:557:14: note: called from here
557 | struct _Bvector_impl
| ^~~~~~~~~~~~~
ソースコード
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int,int>
#define pil pair<int,ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vvpii vector<vector<pair<int,int>>>
#define vvpll vector<vector<pair<ll,ll>>>
template<typename T> void debug(T e){
cerr << e << endl;
}
template<typename T> void debug(vector<T> &v){
rep(i, v.size()){
cerr << v[i] << " ";
}
cerr << endl;
}
template<typename T> void debug(vector<vector<T>> &v){
rep(i, v.size()){
rep(j, v[i].size()){
cerr << v[i][j] << " ";
}
cerr << endl;
}
}
template<typename T> void debug(vector<pair<T, T>> &v){
rep(i,v.size()){
cerr << v[i].first << " " << v[i].second << endl;
}
}
template<typename T> void debug(set<T> &st){
for (auto itr = st.begin(); itr != st.end(); itr++){
cerr << *itr << " ";
}
cerr << endl;
}
template<typename T> void debug(multiset<T> &ms){
for (auto itr = ms.begin(); itr != ms.end(); itr++){
cerr << *itr << " ";
}
cerr << endl;
}
template<typename T> void debug(map<T, T> &mp){
for (auto itr = mp.begin(); itr != mp.end(); itr++){
cerr << itr->first << " " << itr->second << endl;
}
}
void debug_out(){
cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
cerr << H << " ";
debug_out(T...);
}
vector<ll> bitconversion(ll i, ll n, ll N)
{
ll x = 1;
rep(j, N)
{
x *= n;
}
vector<ll> vec(N);
rep(j, N)
{
x /= n;
vec[j] = i / x;
i -= x * vec[j];
}
return vec;
}
vector<vector<ll>> matrix_pow(vector<vector<ll>> &M, vector<ll> &bin, ll N, ll K, ll mod)
{
vector<vector<ll>> matrix(N, vector<ll>(N));
for (ll i = 0; i < N; i++)
{
for (ll j = 0; j < N; j++)
{
matrix[i][j] = M[i][j];
}
}
vector<vector<ll>> ans_old_matrix(N, vector<ll>(N));
for (ll i = 0; i < N; i++)
{
for (ll j = 0; j < N; j++)
{
if (i == j)
ans_old_matrix[i][j] = 1;
else
ans_old_matrix[i][j] = 0;
}
}
vector<vector<ll>> ans_new_matrix(N, vector<ll>(N));
for (ll i = 0; i < N; i++)
{
for (ll j = 0; j < N; j++)
{
ans_new_matrix[i][j] = 0;
}
}
vector<vector<ll>> new_matrix(N, vector<ll>(N));
for (ll i = 0; i < N; i++)
{
for (ll j = 0; j < N; j++)
{
new_matrix[i][j] = 0;
}
}
for (ll x = 0; x < K; x++)
{
if (bin[K - 1 - x] == 1)
{
for (ll i = 0; i < N; i++)
{
for (ll j = 0; j < N; j++)
{
for (ll k = 0; k < N; k++)
{
ans_new_matrix[i][j] = (ans_new_matrix[i][j] + (ans_old_matrix[i][k] * matrix[k][j])) % mod;
}
}
}
for (ll i = 0; i < N; i++)
{
for (ll j = 0; j < N; j++)
{
ans_old_matrix[i][j] = ans_new_matrix[i][j];
ans_new_matrix[i][j] = 0;
}
}
}
for (ll i = 0; i < N; i++)
{
for (ll j = 0; j < N; j++)
{
for (ll k = 0; k < N; k++)
{
new_matrix[i][j] = (new_matrix[i][j] + (matrix[i][k] * matrix[k][j])) % mod;
}
}
}
for (ll i = 0; i < N; i++)
{
for (ll j = 0; j < N; j++)
{
matrix[i][j] = new_matrix[i][j];
new_matrix[i][j] = 0;
}
}
}
return ans_old_matrix;
}
int main(){
ll N;
cin >> N;
vector<vector<ll>> A = {{1, 0, 0}, {0, 1, 1}, {1, 1, 0}};
vector<ll> bin = bitconversion(N - 1, 2, 60);
vector<vector<ll>> ans_m = matrix_pow(A, bin, 3, 60, mod2);
cout << (ans_m[1][0] + ans_m[2][0]) % mod2 << endl;
}