結果

問題 No.2600 Avator Height
ユーザー hibit_athibit_at
提出日時 2024-01-13 00:26:19
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 370 ms / 2,000 ms
コード長 4,340 bytes
コンパイル時間 1,278 ms
コンパイル使用メモリ 113,372 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-28 00:44:01
合計ジャッジ時間 12,955 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
5,248 KB
testcase_01 AC 360 ms
5,376 KB
testcase_02 AC 358 ms
5,376 KB
testcase_03 AC 370 ms
5,376 KB
testcase_04 AC 356 ms
5,376 KB
testcase_05 AC 355 ms
5,376 KB
testcase_06 AC 358 ms
5,376 KB
testcase_07 AC 360 ms
5,376 KB
testcase_08 AC 356 ms
5,376 KB
testcase_09 AC 356 ms
5,376 KB
testcase_10 AC 360 ms
5,376 KB
testcase_11 AC 361 ms
5,376 KB
testcase_12 AC 353 ms
5,376 KB
testcase_13 AC 356 ms
5,376 KB
testcase_14 AC 359 ms
5,376 KB
testcase_15 AC 364 ms
6,940 KB
testcase_16 AC 343 ms
6,940 KB
testcase_17 AC 356 ms
6,940 KB
testcase_18 AC 356 ms
6,940 KB
testcase_19 AC 360 ms
6,940 KB
testcase_20 AC 362 ms
6,944 KB
testcase_21 AC 365 ms
6,944 KB
testcase_22 AC 361 ms
6,944 KB
testcase_23 AC 358 ms
6,940 KB
testcase_24 AC 311 ms
6,944 KB
testcase_25 AC 337 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>
#include <complex>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

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 != (int)v.size() ? " " : "");
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << endl;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v)
{
    int n = v.size();
    int m = v[0].size();
    int p = v[0][0].size();
    rep(k, p)
    {
        os << "k = " << k << endl;
        rep(i, n)
        {
            rep(j, m)
            {
                os << v[i][j][k];
                if (j < m - 1)
                {
                    os << " ";
                }
                else
                {
                    os << endl;
                }
            }
        }
    }
    return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (T &in : v)
        is >> in;
    return is;
}

template <typename T, typename S>
ostream &operator<<(ostream &os, map<T, S> &mp)
{
    for (auto &[key, val] : mp)
    {
        os << key << ":" << val << " ";
    }
    cout << endl;
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, set<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, multiset<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, queue<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, deque<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop_front();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, stack<T> st)
{
    while (st.size())
    {
        os << st.top() << " ";
        st.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T> pq)
{
    while (pq.size())
    {
        os << pq.top() << " ";
        pq.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T, vector<T>, greater<T>> mpq)
{
    while (mpq.size())
    {
        os << mpq.top() << " ";
        mpq.pop();
    }
    return os;
}

#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;
ostream &operator<<(ostream &os, mint &i)
{
    os << i.val();
    return os;
}

ostream &operator<<(ostream &os, const vector<mint> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i].val() << (i + 1 != (int)v.size() ? " " : "");
    }
    return os;
}

int main()
{
    vector<mint> r(2e5 + 10);
    r[0] = 1;
    r[1] = 1;
    vector<mint> e(2e5 + 10);
    e[0] = 1;
    e[1] = 3;
    rep(i, 2e5)
    {
        r[i+2] = r[i+1] + r[i];
        e[i+2] = e[i+1] + e[i];   
    }
    int q;
    cin >> q;
    while(q--){
        int n;
        cin >> n;
        n--;
        mint ans = 5*r[n]*r[n] - e[n]*e[n];
        cout << ans << endl;
    }
}
0