ku-library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub kogetsu0728/ku-library

:heavy_check_mark: test/template/template.test.cpp

Depends on

Required by

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"

#include "../../template/template.hpp"

int main() {
    ll s = 0;

    s = 0;
    rep (i, 0, 10) {
        s += i;
    }
    assert(s == 45);
    assert(chmin(s, 0LL));
    assert(chmax(s, 100LL));

    heap<int> max_queue_1;
    heap<int, false> max_queue_2;
    heap<int, true> min_queue;
    rep (i, 0, 10) {
        max_queue_1.emplace(i);
        max_queue_2.emplace(i);
        min_queue.emplace(i);
    }
    assert(max_queue_1.top() == 9);
    assert(max_queue_2.top() == 9);
    assert(min_queue.top() == 0);

    s = 0;
    rep (i, 0, 10, 1) {
        s += i;
    }
    assert(s == 45);

    s = 0;
    rep (i, 0, 10, 1) {
        s += i;
    }
    assert(s == 45);

    s = 0;
    rep (i, 0, 10, 9) {
        s += i;
    }
    assert(s == 9);

    s = 0;
    rrep (i, 9, 0) {
        s += i;
    }
    assert(s == 45);

    s = 0;
    rrep (i, 9, 0, 1) {
        s += i;
    }
    assert(s == 45);

    s = 0;
    rrep (i, 9, 0, 9) {
        s += i;
    }
    assert(s == 9);

    string ans = "Hello World";

    cout << ans << LF;

    return 0;
}

#line 1 "test/template/template.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"

#line 2 "template/template.hpp"

/**
 * @author ku_senjan
 * @title 提出用テンプレート
 * @see https://github.com/kogetsu0728/ku-library
 */

#line 2 "template/constant.hpp"

#line 2 "template/include.hpp"

#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>
using namespace std;
#line 2 "template/type_alias.hpp"

#line 4 "template/type_alias.hpp"

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;

using ld = long double;

template <class T, bool REVERSE = false>
using heap = priority_queue<T, vector<T>, conditional_t<REVERSE, greater<T>, less<T>>>;
#line 5 "template/constant.hpp"

template <class T>
inline constexpr T INF = numeric_limits<T>::max() / 2;

inline constexpr array<int, 4> DY4 = {0, -1, 0, 1};
inline constexpr array<int, 4> DX4 = {1, 0, -1, 0};
inline constexpr array<int, 8> DY8 = {0, -1, -1, -1, 0, 1, 1, 1};
inline constexpr array<int, 8> DX8 = {1, 1, 0, -1, -1, -1, 0, 1};

inline constexpr char LF = '\n';
#line 2 "template/macro.hpp"

#line 5 "template/macro.hpp"

/**
 * @see https://trap.jp/post/1224/
 */

#ifdef LOCAL
inline constexpr bool IS_LOCAL = true;
#else
inline constexpr bool IS_LOCAL = false;
#endif

#define IF_LOCAL if constexpr (IS_LOCAL)

#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)

#define overload4(a, b, c, d, e, ...) e

#define rep1(i, a) for (ll i = 0; (i) < (ll)(a); ++(i))
#define rep2(i, a, b) for (ll i = (ll)(a); (i) < (ll)(b); ++(i))
#define rep3(i, a, b, c) for (ll i = (ll)(a); (i) < (ll)(b); (i) += (ll)(c))
#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep1(i, a) for (ll i = (ll)(a); (i) >= 0; --(i))
#define rrep2(i, a, b) for (ll i = (ll)(a); (i) >= (ll)(b); --(i))
#define rrep3(i, a, b, c) for (ll i = (ll)(a); (i) >= (ll)(b); (i) -= (ll)(c))
#define rrep(...) overload4(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__)
#line 13 "template/template.hpp"

#line 2 "utility/choose_min_max.hpp"

/**
 * @title Choose Minimum / Maximum
 */

template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }

    return false;
}

template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }

    return false;
}
#line 2 "utility/set_io.hpp"

#line 4 "utility/set_io.hpp"

void set_io(int d = 16) {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(d);

    return;
}
#line 4 "test/template/template.test.cpp"

int main() {
    ll s = 0;

    s = 0;
    rep (i, 0, 10) {
        s += i;
    }
    assert(s == 45);
    assert(chmin(s, 0LL));
    assert(chmax(s, 100LL));

    heap<int> max_queue_1;
    heap<int, false> max_queue_2;
    heap<int, true> min_queue;
    rep (i, 0, 10) {
        max_queue_1.emplace(i);
        max_queue_2.emplace(i);
        min_queue.emplace(i);
    }
    assert(max_queue_1.top() == 9);
    assert(max_queue_2.top() == 9);
    assert(min_queue.top() == 0);

    s = 0;
    rep (i, 0, 10, 1) {
        s += i;
    }
    assert(s == 45);

    s = 0;
    rep (i, 0, 10, 1) {
        s += i;
    }
    assert(s == 45);

    s = 0;
    rep (i, 0, 10, 9) {
        s += i;
    }
    assert(s == 9);

    s = 0;
    rrep (i, 9, 0) {
        s += i;
    }
    assert(s == 45);

    s = 0;
    rrep (i, 9, 0, 1) {
        s += i;
    }
    assert(s == 45);

    s = 0;
    rrep (i, 9, 0, 9) {
        s += i;
    }
    assert(s == 9);

    string ans = "Hello World";

    cout << ans << LF;

    return 0;
}

Test cases

Env Name Status Elapsed Memory
g++ judge_data :heavy_check_mark: AC 5 ms 3 MB
Back to top page