#800583 (C++17) No.2079 aaabbc

提出ソース

結果

問題	No.2079 aaabbc
ユーザー	ganmodokix
提出日時	2022-09-25 21:53:47
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	2 ms / 2,000 ms
コード長	9,533 bytes
コンパイル時間	2,295 ms
コンパイル使用メモリ	206,112 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-06-01 23:29:28
合計ジャッジ時間	2,986 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	1 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	1 ms 5,376 KB
testcase_06	AC	1 ms 5,376 KB
testcase_07	AC	1 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	1 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	1 ms 5,376 KB
testcase_13	AC	1 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	1 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// モジュール
// #REQ: base_template.cpp modint998244353.cpp
// <!-- GENERATED BEGIN -->
// <!-- base_template/ll.cpp -->
using  ll = long signed long;
using ull = long unsigned long;
using  ld = long double;
// <!-- base_template/575.cpp -->
#include <bits/stdc++.h>
using namespace std;
// <!-- base_template/macro.cpp -->
// #REQ: base_template/575 base_template/ll
// 汎用マクロ
#define ALL(x) (begin(x)), (end(x))
#define ALLOF(x) (begin(x)), (end(x))
#define RALL(x) (rbegin(x)), (rend(x))
#define RALLOF(x) (rbegin(x)), (rend(x))
#define RPE REP
#define ERP REP
#define EPR REP
#define PER REP
#define PRE REP
#define REP(i,n) for (ll i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (ll i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (ll i=(is), i##_end=(ie); i>=i##_end; i--)
#define STEP(i, is, ie, step) for (ll i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
#define FOREACH(i,q) for (auto &i : q)
template<typename T, typename U> bool chmax(T &a, const U b) { if (a < b) {a = b; return true;} return false; }
template<typename T, typename U> bool chmin(T &a, const U b) { if (a > b) {a = b; return true;} return false; }
constexpr int INF = numeric_limits<int>::max();
constexpr ll LINF = numeric_limits<ll>::max();
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define IIF(q,t,f) ((q) ? (t) : (f))
// <!-- base_template/debug_mode.cpp -->
// AtCoder/Codeforces 用 デバッグ検知
#ifdef ONLINE_JUDGE
constexpr bool DEBUG_MODE = false;
#else
constexpr bool DEBUG_MODE = true;
#endif
// <!-- base_template/qin.cpp -->
// #REQ: base_template/575 base_template/ll base_template/macro
// 標準入出力
struct qin { // query input
    size_t sz;
    qin(size_t _sz = 1) : sz(_sz) {}
    template <typename T> operator T () const { T a; cin >> a; return a; }
    template <typename T> operator vector<T> () const { vector<T> a(sz); for (size_t i = 0; i < sz; i++) cin >> a[i]; return a; }
    template <typename T, typename U> operator pair<T, U> () const { T f; U s; cin >> f >> s; return pair<T, U>(f, s); }
};
qin in1; // input one
template <typename T> void say(const T x, const char* end = "\n") { cout << x << end; }
void say(const ld x, const char* end = "\n") { cout << setprecision(30) << x << end; }
template <typename T> void say(const vector<T> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { cout << x[i] << (i+1 == i_len ? end : sep); } }
template <typename T> void say(const vector<vector<T>> x, const char* sep = " ", const char* end = "\n") { REP(i, x.size()) { say(x[i], sep, end); } }
// <!-- base_template/dump.cpp -->
// #REQ: base_template/575 base_template/debug_mode
#define DUMP(q) DUMP_FUNC(q, #q, __FILE__, __LINE__)
template <typename T> void DUMP_PROC(T x) { if (is_integral<T>() || is_floating_point<T>()) cerr << "\e[32m" << x << "\e[m"; else cerr << x; }
template<> void DUMP_PROC<char>(char x) { cerr << "\e[36m\'" << x << "\'\e[m"; }
template<> void DUMP_PROC<string>(string x) { cerr << "\e[33m\"" << x << "\"\e[m"; }
template <typename T, typename U> void DUMP_PROC(pair<T, U> x) { cerr << "{"; DUMP_PROC(x.first); cerr << ", "; DUMP_PROC(x.second); cerr << "}"; }
template <typename ...T, typename U, U... Seq> void DUMP_PROC(tuple<T...> &x, integer_sequence<U, Seq...>) { (void)(int[]){(cerr << ((const char*[]){"", ", "})[!!Seq] << (DUMP_PROC(get<Seq>(x)), ""), 0)...}; }
template <typename ...T> void DUMP_PROC(tuple<T...> x) {cerr << "{"; DUMP_PROC(x, index_sequence_for<T...>()); cerr << "}";}
template <typename T> void DUMP_PROC(vector<T> x) { cerr << "["; for (auto &xi : x) { DUMP_PROC(xi); cerr << (&xi != &*x.rbegin()?", ":""); } cerr << "]"; }
template <typename T> void DUMP_FUNC(T x, const char* name, const char* fn, int ln) { if (!DEBUG_MODE) return; cerr << "\e[32m[DEBUG]\e[m " << name << ": "; DUMP_PROC(x); cerr << " @ " << fn << "(" << ln << ")" << endl; }
#define DUMPT(...) DUMP(tuple(__VA_ARGS__))
// <!-- base_template/gcc.cpp -->
// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
// <!-- base_template.cpp -->
// #REQ: base_template/575 base_template/ll base_template/debug_mode base_template/gcc base_template/macro base_template/dump base_template/qin

// base template set
// <!-- modint_factorial_cache.cpp -->
// #REQ: base_template.cpp
template <typename T>
struct factorial_cache {

    vector<T> fac = {T(1)}, invfac = {T(1)};

    void prepare(long long nmax) {

        if (nmax < (long long)fac.size()) return;
        while (!(nmax < (long long)fac.size())) {
            fac.emplace_back(fac.back() * fac.size());
        }

        long long m0 = invfac.size();
        invfac.resize(nmax+1);
        invfac[nmax] = fac[nmax].inv();
        for (long long n = nmax; --n >= m0; ) {
            invfac[n] = invfac[n+1] * (n+1);
        }

    }

};
// <!-- modint.cpp -->
template <long long pdiv>
struct moduloint {
    long long x = 0;
    constexpr moduloint(long long _x = 0) noexcept: x(regularize(_x)) {}
    static constexpr long long regularize(long long x) noexcept { x %= pdiv; x += pdiv; return x - (x >= pdiv ? pdiv : 0); }
    static constexpr long long regularize(moduloint a) noexcept { return a.x; }
    static constexpr long long llpow(long long a, long long n) noexcept {
        a %= pdiv; if (a < 0) a += pdiv;
        n %= pdiv-1; if (n < 0) n += pdiv-1;
        long long result = 1;
        for (long long base = a; n; n >>= 1) {
            if (n & 1) (result *= base) %= pdiv;
            (base *= base) %= pdiv;
        }
        return result;
    }
    static constexpr long long llinv(long long a) noexcept { return llpow(a, pdiv-2); }
    static constexpr long long llinv(moduloint a) noexcept { return a.pow(pdiv-2).x; }
    constexpr moduloint pow(long long n) const noexcept { return moduloint(llpow(x, n)); }
    constexpr moduloint inv() const noexcept { return moduloint(llinv(x)); }
    constexpr moduloint& operator+= (moduloint a) noexcept { x +=        a.x; if (x >= pdiv) x -= pdiv; return *this; }
    constexpr moduloint& operator-= (moduloint a) noexcept { x += pdiv - a.x; if (x >= pdiv) x -= pdiv; return *this; }
    constexpr moduloint& operator*= (moduloint a) noexcept { (x *=       a.x ) %= pdiv; return *this; }
    constexpr moduloint& operator/= (moduloint a) noexcept { (x *= llinv(a.x)) %= pdiv; return *this; }
    template <typename T> constexpr moduloint& operator+= (T a) noexcept { return *this += moduloint(a); }
    template <typename T> constexpr moduloint& operator-= (T a) noexcept { return *this -= moduloint(a); }
    template <typename T> constexpr moduloint& operator*= (T a) noexcept { return *this *= moduloint(a); }
    template <typename T> constexpr moduloint& operator/= (T a) noexcept { return *this /= moduloint(a); }
    template <typename T> constexpr moduloint operator+ (T a) const noexcept { return moduloint(*this) += a; }
    template <typename T> constexpr moduloint operator- (T a) const noexcept { return moduloint(*this) -= a; }
    template <typename T> constexpr moduloint operator* (T a) const noexcept { return moduloint(*this) *= a; }
    template <typename T> constexpr moduloint operator/ (T a) const noexcept { return moduloint(*this) /= a; }
    constexpr moduloint operator- () const noexcept { return moduloint(pdiv - x); }
};
template <long long pdiv>
constexpr moduloint<pdiv> operator+ (const long long a, const moduloint<pdiv> b) noexcept { return moduloint<pdiv>(a) + b; }
template <long long pdiv>
constexpr moduloint<pdiv> operator- (const long long a, const moduloint<pdiv> b) noexcept { return moduloint<pdiv>(a) - b; }
template <long long pdiv>
constexpr moduloint<pdiv> operator* (const long long a, const moduloint<pdiv> b) noexcept { return moduloint<pdiv>(a) * b; }
template <long long pdiv>
constexpr moduloint<pdiv> operator/ (const long long a, const moduloint<pdiv> b) noexcept { return moduloint<pdiv>(a) / b; }
// <!-- modint998244353.cpp -->
// #REQ: base_template modint modint_factorial_cache
using modint = moduloint<998244353LL>;

// IO
constexpr modint operator"" _p(unsigned long long _x) noexcept { return modint(_x); }
ostream& operator<< (ostream& ost, const modint a) { return ost << a.x; }
istream& operator>> (istream& ist, modint &a) { return ist >> a.x; }

// Factorial n!
factorial_cache<modint> fac_cache;
modint    fac(long long n) { fac_cache.prepare(n); return fac_cache.fac[n]; }
modint invfac(long long n) { fac_cache.prepare(n); return fac_cache.invfac[n]; }
constexpr bool isinpascal(long long n, long long r) noexcept { return 0 <= r && r <= n; }
modint nCr(long long n, long long r) { return !isinpascal(n, r) ? 0_p : fac(n) * invfac(r) * invfac(n-r); }
modint nPr(long long n, long long r) { return !isinpascal(n, r) ? 0_p : fac(n) * invfac(n-r); }
modint nHr(long long n, long long r) { return nCr(n+r-1, r); }
modint catalan(long long n) { return nCr(n * 2, n) / (n + 1); }
// <!-- GENERATED END -->
// #END

// 処理内容
int main() {
    
    ios::sync_with_stdio(false); // stdioを使うときはコメントアウトすること
    cin.tie(nullptr);            // インタラクティブ問題ではコメントアウトすること
    
    // code here
    ll n = in1;
    say((3_p).pow(n));
    
}

yukicoder

結果

テストケース

ソースコード