結果

問題 No.9000 Hello World! （テスト用）
ユーザー w2w2w2w2
提出日時 2021-10-30 19:29:14
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 5,000 ms
コード長 8,644 bytes
コンパイル時間 6,114 ms
コンパイル使用メモリ 301,372 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-15 01:53:03
合計ジャッジ時間 6,545 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 998244353
// #define MOD_TYPE 1000000007
// #define EXPAND
#pragma region Macros
#pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>) || defined(EXPAND)
#include <atcoder/convolution>
#include <atcoder/fenwicktree>
#include <atcoder/lazysegtree>
#include <atcoder/math>
#include <atcoder/maxflow>
#include <atcoder/mincostflow>
#include <atcoder/modint>
#include <atcoder/scc>
#include <atcoder/segtree>
#include <atcoder/string>
#include <atcoder/twosat>
using namespace atcoder;
#endif
using ll= long long;
using ld= long double;
using ull= unsigned long long;
using i128= __int128;
using pll= pair<ll, ll>;
template <class T> using vec= vector<T>;
using vi= vec<int>;
using vl= vec<ll>;
using vd= vec<ld>;
using vs= vec<string>;
using vi128= vec<i128>;
using vpll= vec<pll>;
using vvi= vec<vi>;
using vvl= vec<vl>;
using vvd= vec<vd>;
using vvs= vec<vs>;
using vvi128= vec<vi128>;
using vvpll= vec<vpll>;
#if __has_include(<atcoder/modint>) || defined(EXPAND)
#if MOD_TYPE == 1000000007
using mint= modint1000000007;
#elif MOD_TYPE == 998244353
using mint= modint998244353;
#endif
using vm= vec<mint>;
using vvm= vec<vm>;
#endif
#if MOD_TYPE == 1000000007
constexpr ll mod= 1e9 + 7;
#elif MOD_TYPE == 998244353
constexpr ll mod= 998244353;
#endif
#define ALL(x) (x).begin(), (x).end()
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define REPBASE(i, a, b) for(ll i= (a), i##_b= (b); i < i##_b; i++)
#define RREPBASE(i, a, b) for(ll i= (a), i##_b= (b); i >= i##_b; i--)
#define LOOP(n) REPBASE(i##__COUNTER__##_##__LINE__, 0, n)
#define REPB(i, n) REPBASE(i, 0, n)
#define REPS(i, n) REPBASE(i, 1, n + 1)
#define RREP(i, n) RREPBASE(i, n - 1, 0)
#define RREPS(i, n) RREPBASE(i, n, 1)
#define REP(...) OVERLOAD3(__VA_ARGS__, REPBASE, REPB, LOOP)(__VA_ARGS__)
#define EACH(x, c) for(auto &&x : c)
#define PERM(p)   \
    sort(ALL(p)); \
    for(bool(p##c)= 1; (p##c); (p##c)= next_permutation(ALL(p)))
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define likely(x) __builtin_expect(!!(x), 1)
#define unlikely(x) __builtin_expect(!!(x), 0)
template <class T> inline ll SZ(T &&x) {
    return forward<T>(x).size();
}
ll topbit(const ll &t) {
    return (t == 0 ? -1 : 63 - __builtin_clzll(t));
}
ll BIT(const ll &n) {
    return (1LL << n);
}
template <class T> inline string YES(const T &n) {
    return (n ? "YES" : "NO");
}
template <class T> inline string Yes(const T &n) {
    return (n ? "Yes" : "No");
}
template <class T> inline string yes(const T &n) {
    return (n ? "yes" : "no");
}
template <class T> inline void uniq(T &v) {
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <class T, class U> inline ll lb(const T &v, const U &x) {
    return distance(v.begin(), lower_bound(v.begin(), v.end(), x));
}
template <class T, class U, class Compare>
inline ll lb(const T &v, const U &x, Compare comp) {
    return distance(v.begin(), lower_bound(v.begin(), v.end(), x, comp));
}
template <class T, class U, class V>
inline ll er(const T &v, const U &x, const V &y) {
    return distance(lower_bound(v.begin(), v.end(), x),
                    upper_bound(v.begin(), v.end(), y));
}
template <class T, class U, class V, class Compare>
inline ll er(const T &v, const U &x, const V &y, Compare comp) {
    return distance(lower_bound(v.begin(), v.end(), x, comp),
                    upper_bound(v.begin(), v.end(), y, comp));
}
template <class T, class U> inline ll ub(const T &v, const U &x) {
    return distance(v.begin(), upper_bound(v.begin(), v.end(), x));
}
template <class T, class U, class Compare>
inline ll ub(const T &v, const U &x, Compare comp) {
    return distance(v.begin(), upper_bound(v.begin(), v.end(), x, comp));
}
template <class T> inline bool chmax(T &a, const T &b) {
    if(a < b) {
        a= b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
    if(b < a) {
        a= b;
        return 1;
    }
    return 0;
}
const vpll dx4{{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const vpll dx8{{1, 0},  {1, 1},   {0, 1},  {-1, 1},
               {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
template <class F> struct rec_lambda {
    F f;
    rec_lambda(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const {
        return f(*this, forward<Args>(args)...);
    }
};
#define VEC(name, size, ...)        \
    vector<__VA_ARGS__> name(size); \
    IN(name)
#define VV(name, h, w, ...)                                        \
    vector<vector<__VA_ARGS__>> name((h), vector<__VA_ARGS__>(w)); \
    IN(name)
#define LL(...)     \
    ll __VA_ARGS__; \
    IN(__VA_ARGS__)
#define STR(...)        \
    string __VA_ARGS__; \
    IN(__VA_ARGS__)
#define LD(...)     \
    ld __VA_ARGS__; \
    IN(__VA_ARGS__)
#define I128(...)     \
    i128 __VA_ARGS__; \
    IN(__VA_ARGS__)
void _scan() {}
template <class T, class S> void _scan(pair<T, S> &p) {
    _scan(p.fi), _scan(p.se);
}
template <class T> void _scan(T &a) {
    cin >> a;
}
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
    _scan(head);
    IN(tail...);
}
#if __has_include(<atcoder/modint>)  || defined(EXPAND)
inline ostream &operator<<(ostream &stream, const mint &m) {
    stream << m.val();
    return stream;
}
#endif
template <class T> inline istream &operator>>(istream &stream, vector<T> &v) {
    EACH(x, v)
    stream >> x;
    return stream;
}
template <class T>
inline ostream &operator<<(ostream &stream, const vector<T> &v) {
    ll szv= v.size();
    REP(i, szv) {
        stream << v[i] << (i == szv - 1 ? "" : " ");
    }
    return stream;
}
template <class T>
inline ostream &operator<<(ostream &stream, const vector<vector<T>> &v) {
    ll szv= v.size();
    REP(i, szv) {
        stream << v[i] << (i == szv - 1 ? "" : "\n");
    }
    return stream;
}
template <class T, class U>
inline istream &operator>>(istream &stream, pair<T, U> &p) {
    stream >> p.fi >> p.se;
    return stream;
}
template <class T, class U>
inline ostream &operator<<(ostream &stream, const pair<T, U> &p) {
    stream << p.fi << " " << p.se;
    return stream;
}
template <class T, class U>
inline pair<T, U> operator+(pair<T, U> p, const pair<T, U> &q) {
    p+= q;
    return p;
}
template <class T, class U>
inline pair<T, U> &operator+=(pair<T, U> &p, const pair<T, U> &q) {
    p.fi+= q.fi;
    p.se+= q.se;
    return p;
}
template <class T, class U>
inline pair<T, U> operator-(pair<T, U> p, const pair<T, U> &q) {
    p-= q;
    return p;
}
template <class T, class U>
inline pair<T, U> &operator-=(pair<T, U> &p, const pair<T, U> &q) {
    p.fi-= q.fi;
    p.se-= q.se;
    return p;
}
template <class T, class U> inline pair<T, U> operator+(const pair<T, U> &p) {
    return p;
}
template <class T, class U> inline pair<T, U> operator-(const pair<T, U> &p) {
    return mp(-p.fi, -p.se);
}
inline i128 parse(string &s) {
    reverse(s.begin(), s.end());
    i128 ret= 0;
    bool minus= 0;
    if(s.back() == '-') {
        minus= 1;
        s.pop_back();
    }
    while(!s.empty()) {
        if('0' <= s.back() && s.back() <= '9') {
            ret= ret * 10 + s.back() - '0';
            s.pop_back();
        } else {
            break;
        }
    }
    reverse(s.begin(), s.end());
    if(minus) ret*= -1;
    return ret;
}
inline string to_string(i128 val) {
    string ret= "";
    bool minus= 0;
    if(val < 0) {
        minus= 1;
        val*= -1;
    }
    do {
        ll digit= val % 10;
        ret+= to_string(digit);
        val/= 10;
    } while(val != 0);
    if(minus) ret+= "-";
    reverse(ret.begin(), ret.end());
    return ret;
}
inline istream &operator>>(istream &stream, i128 &val) {
    string str;
    stream >> str;
    val= parse(str);
    while(!str.empty()) {
        stream.putback(str.back());
        str.pop_back();
    }
    return stream;
}
inline ostream &operator<<(ostream &stream, const i128 &val) {
    stream << to_string(val);
    return stream;
}
template <class Head, class... Tail>
inline void print(const Head &H, const Tail &...T) {
    cout << H;
    (cout << ... << (cout << " ", T));
    cout << "\n";
}
template <class Head, class... Tail>
inline void debug_out(const Head &H, const Tail &...T) {
    cout << H;
    (cout << ... << (cout << " ", T));
    cout << endl;
}
#ifdef _DEBUG
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
#pragma endregion

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    print("Hello World!");
}
0