Internal Definition
(lib/internal.hpp)

• View this file on GitHub
• Last update: 2024-06-14 09:23:51+08:00
• Include: #include "lib/internal.hpp"

Required by

• Double Ended Priority Queue (lib/ds/depque.hpp)
• lib/ds/dynsegtree.hpp
• lib/ds/lazysegtree.hpp
• Link Cut Tree (lib/ds/lct.hpp)
• Random Binary Search Tree (lib/ds/rbst.hpp)
• Segment Tree (lib/ds/segtree.hpp)
• Splay Tree (lib/ds/splay.hpp)
• Max Flow (lib/graph/maxflow.hpp)
• Strongly Connected Components (lib/graph/scc.hpp)
• Polynomial Convolution (lib/math/convolution.hpp)
• Dynamic Modint (lib/math/dynamic_modint.hpp)
• Lucas Theorem (lib/math/lucas.hpp)
• Static Modint (lib/math/static_modint.hpp)
• Usual Math Algorithm (lib/math/utility.hpp)
• Bit Manipulation (lib/misc/bitop.hpp)
• lib/monoid/monoid_add.hpp
• lib/monoid/monoid_affine.hpp
• lib/monoid/monoid_linear_function.hpp
• lib/monoid/monoid_trait.hpp
• lib/str/kmp.hpp

Verified with

• verify/ds/area_of_union_of_rectangles.test.cpp
• verify/ds/double_ended_priority_queue.test.cpp
• verify/ds/dynamic_sequence_range_affine_range_sum_rbst.test.cpp
• verify/ds/dynamic_sequence_range_affine_range_sum_splay.test.cpp
• verify/ds/dynamic_tree_vertex_add_path_sum.test.cpp
• verify/ds/point_add_range_sum.test.cpp
• verify/ds/point_set_range_composite.test.cpp
• verify/ds/static_range_inversions_query.test.cpp
• verify/graph/scc.test.cpp
• verify/math/bitwise_and_convolution.test.cpp
• verify/math/bitwise_xor_convolution.test.cpp
• verify/math/convolution.test.cpp
• verify/math/subset_convolution.test.cpp
• verify/str/longest_common_substring.test.cpp
• verify/str/number_of_substrings.test.cpp
• verify/str/suffixarray.test.cpp

Code

/**
 * @brief Internal Definition
 */
#pragma once
#include <cmath>
#include <tuple>
#include <vector>
#include <utility>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>

using i32 = int;
using i64 = long long;
using i128 = __int128_t;
using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;

template <typename T> using vec = std::vector<T>;
using pii = std::pair<int, int>;

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.10/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
  File "/home/runner/.local/lib/python3.10/site-packages/onlinejudge_verify/languages/cplusplus.py", line 187, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.10/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 312, in update
    raise BundleErrorAt(path, i + 1, "#pragma once found in a non-first line")
onlinejudge_verify.languages.cplusplus_bundle.BundleErrorAt: lib/internal.hpp: line 4: #pragma once found in a non-first line

Back to top page