verify用テンプレート
(Utility/template.hpp)

• View this file on GitHub
• Last update: 2024-12-28 00:04:13+09:00
• Include: #include "Utility/template.hpp"

Required by

• example/matrix.example.cpp
• example/offline_connectivity.example.cpp
• example/range_edge_graph.example.cpp
• example/rhash.example.cpp
• example/simple_treap.example.cpp
• verify/Convolution_gcd_convolution_test.cpp
• 砂場/binarytrie.example.cpp
• 砂場/simple_treap.henkou.cpp

Verified with

• verify/Algorithm_bisect_max_right.test.cpp
• verify/Algorithm_bisect_min_left.test.cpp
• verify/Algorithm_doubling.test.cpp
• verify/Chromatic_Number.test.cpp
• verify/Chromatic_Number_with_restoration.test.cpp
• verify/Convolution_gcd_convolution.test.cpp
• verify/Convolution_lcm_convolution.test.cpp
• verify/Datastructure_1dimos.test.cpp
• verify/Datastructure_2dbit.test.cpp
• verify/Datastructure_2dsegtree_add.test.cpp
• verify/Datastructure_2dsegtree_max.test.cpp
• verify/Datastructure_DST.test.cpp
• verify/Datastructure_binary_trie.test.cpp
• verify/Datastructure_binary_trie_xor.test.cpp
• verify/Datastructure_compress.test.cpp
• verify/Datastructure_dsu.test.cpp
• verify/Datastructure_dynamicseg.test.cpp
• verify/Datastructure_fastset.test.cpp
• verify/Datastructure_fenwick_tree.test.cpp
• verify/Datastructure_imos2d.test.cpp
• verify/Datastructure_lazyseg_bina.test.cpp
• verify/Datastructure_lazysegtree.test.cpp
• verify/Datastructure_offline_connectivity.test.cpp
• verify/Datastructure_offline_connectivity_more.test.cpp
• verify/Datastructure_pbds_set.test.cpp
• verify/Datastructure_point_add_rec_sum.test.cpp
• verify/Datastructure_potential_dsu.test.cpp
• verify/Datastructure_rangeset.test.cpp
• verify/Datastructure_seg_prod.test.cpp
• verify/Datastructure_segtree.test.cpp
• verify/Datastructure_simpletreap.test.cpp
• verify/Datastructure_sprase_table.test.cpp
• verify/Datastructure_static1dsum.test.cpp
• verify/Datastructure_static2dsum.test.cpp
• verify/Datastructure_swag.test.cpp
• verify/Datastructure_swag_more.test.cpp
• verify/Datastructure_treap.test.cpp
• verify/Datastructure_undabledsu.test.cpp
• verify/Datastructure_value_dsu.test.cpp
• verify/Graph_cycle_detection_1.test.cpp
• verify/Graph_cycle_detection_2.test.cpp
• verify/Graph_graph_bellman.test.cpp
• verify/Graph_graph_bellman_and_warshall.test.cpp
• verify/Graph_graph_cycle_detection_directed.test.cpp
• verify/Graph_graph_cycle_detection_undirected.test.cpp
• verify/Graph_graph_diameter.test.cpp
• verify/Graph_graph_dijkstra.test.cpp
• verify/Graph_scc.test.cpp
• verify/Graph_scc_old.test.cpp
• コンビネーション (verify/Math_combination.test.cpp)
• verify/Math_combination_more.test.cpp
• verify/Math_matrix_det.test.cpp
• verify/Math_matrix_inv.test.cpp
• verify/Math_matrix_pow.test.cpp
• verify/Math_matrix_rank.test.cpp
• verify/Rhash.test.cpp
• verify/Rhash_more.test.cpp
• verify/aux_tree.test.cpp
• verify/bellman_ford.test.cpp
• verify/bi_connected.test.cpp
• verify/bitwise_and_convolution.test.cpp
• verify/dijkstra.test.cpp
• verify/extgcd.test.cpp
• verify/floor_sum.test.cpp
• verify/fps_count_subset_sum.test.cpp
• verify/fps_exp.test.cpp
• verify/fps_inv.test.cpp
• verify/fps_log.test.cpp
• verify/fps_pow.test.cpp
• verify/hld.test.cpp
• verify/hld_lca.test.cpp
• verify/jumpontree.test.cpp
• verify/lowlink_bridge.test.cpp
• verify/lowlink_joint.test.cpp
• verify/manacher.test.cpp
• verify/mat_det.test.cpp
• verify/matrix.test.cpp
• verify/maxflow.test.cpp
• verify/maxflow_lowerbound.test.cpp
• verify/maximum_independent_set.test.cpp
• verify/mo.test.cpp
• verify/oneside_range_edge_graph.test.cpp
• verify/range_edge_graph.test.cpp
• verify/superset_transform.test.cpp
• verify/treedp.test.cpp
• verify/two_edge_connected.test.cpp
• 砂場/swag.test.cpp

Code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)

#define TT template <typename T>
TT using vec = vector<T>;
template <class T1, class T2> bool chmin(T1 &x, T2 y) {
    return x > y ? (x = y, true) : false;
}
template <class T1, class T2> bool chmax(T1 &x, T2 y) {
    return x < y ? (x = y, true) : false;
}
struct io_setup {
    io_setup() {
        ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        cout << fixed << setprecision(15);
    }
} io_setup;

/*
@brief verify用テンプレート
*/

#line 1 "Utility/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)

#define TT template <typename T>
TT using vec = vector<T>;
template <class T1, class T2> bool chmin(T1 &x, T2 y) {
    return x > y ? (x = y, true) : false;
}
template <class T1, class T2> bool chmax(T1 &x, T2 y) {
    return x < y ? (x = y, true) : false;
}
struct io_setup {
    io_setup() {
        ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        cout << fixed << setprecision(15);
    }
} io_setup;

/*
@brief verify用テンプレート
*/

Back to top page