#943556 (C++17) No.2600 Avator Height

• 問題: No.2600 Avator Height
• ユーザー: asaringo
• 提出日時: 2024-01-12 22:32:48
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 65 ms / 2,000 ms
• コード長: 5,063 bytes
• コンパイル時間: 2,668 ms
• コンパイル使用メモリ: 216,168 KB
• 実行使用メモリ: 7,412 KB
• 最終ジャッジ日時: 2024-09-27 23:11:10
• 合計ジャッジ時間: 6,886 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	5 ms; 6,816 KB
testcase_01	AC	61 ms; 7,408 KB
testcase_02	AC	65 ms; 7,276 KB
testcase_03	AC	62 ms; 7,404 KB
testcase_04	AC	64 ms; 7,280 KB
testcase_05	AC	62 ms; 7,284 KB
testcase_06	AC	63 ms; 7,404 KB
testcase_07	AC	62 ms; 7,280 KB
testcase_08	AC	63 ms; 7,408 KB
testcase_09	AC	63 ms; 7,408 KB
testcase_10	AC	62 ms; 7,408 KB
testcase_11	AC	62 ms; 7,408 KB
testcase_12	AC	62 ms; 7,280 KB
testcase_13	AC	64 ms; 7,280 KB
testcase_14	AC	62 ms; 7,280 KB
testcase_15	AC	63 ms; 7,412 KB
testcase_16	AC	64 ms; 7,152 KB
testcase_17	AC	65 ms; 7,280 KB
testcase_18	AC	63 ms; 7,280 KB
testcase_19	AC	60 ms; 7,404 KB
testcase_20	AC	61 ms; 7,404 KB
testcase_21	AC	61 ms; 7,408 KB
testcase_22	AC	61 ms; 7,412 KB
testcase_23	AC	59 ms; 7,404 KB
testcase_24	AC	39 ms; 7,284 KB
testcase_25	AC	50 ms; 7,412 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#define overload2(a, b, c, ...) c
#define overload3(a, b, c, d, ...) d
#define overload4(a, b, c, d, e ...) e
#define overload5(a, b, c, d, e, f ...) f
#define overload6(a, b, c, d, e, f, g ...) g
#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
typedef long long ll;
typedef long double ld;
#define chmin(a,b) a = min(a,b);
#define chmax(a,b) a = max(a,b);
#define bit_count(x) __builtin_popcountll(x)
#define leading_zero_count(x) __builtin_clz(x)
#define trailing_zero_count(x) __builtin_ctz(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(...) overload3(__VA_ARGS__, rrep, rep1)(__VA_ARGS__)
#define rep1(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)
#define pt(a) cout << a << endl;
#define print(...) printall(__VA_ARGS__);
#define debug(a) cout << #a << " " << a << endl;
#define all(a) a.begin(), a.end()
#define endl "\n";
#define v1(T,n,a) vector<T>(n,a)
#define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a))
#define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a))
#define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a))
template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;}

const int mod = 998244353;

template< int mod >
struct ModInt {
    int x;

    ModInt() : x(0) {}

    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p) {
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }

    ModInt operator-() const { return ModInt(-x); }

    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

    bool operator==(const ModInt &p) const { return x == p.x; }

    bool operator!=(const ModInt &p) const { return x != p.x; }

    ModInt inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }

    friend istream &operator>>(istream &is, ModInt &a) {
        int64_t t;
        is >> t;
        a = ModInt< mod >(t);
        return (is);
    }

    static int get_mod() { return mod; }
};

using modint = ModInt< mod >;

int n;

void solve(){
    cin >> n;
    vector<tuple<int,int>> Q(n);
    rep(i,n){
        int k;
        cin >> k;
        Q[i] = {k,i};
    }
    sort(all(Q));
    vector<modint> R = {1,1}, E = {1,3};
    vector<modint> res(n);
    reverse(all(Q));
    rep(i,1,202020){
        while(!Q.empty()){
            auto[k,id] = Q.back();
            if(k != i) break;
            Q.pop_back();
            res[id] = R[i-1] * R[i-1] * 5 - E[i-1] * E[i-1];
        }
        if(i == 1) continue;
        R.push_back(R[i-1] + R[i-2]);
        E.push_back(E[i-1] + E[i-2]);
    }
    rep(i,n){
        pt(res[i])
    }
}

int main(){
    fast_io
    int t = 1;
    // cin >> t;
    rep(i,t) solve();
}