Library/Common.hpp

• View this file on GitHub
• Last update: 2025-04-30 01:32:17+09:00
• Include: #include "Library/Common.hpp"

Required by

• Binary Indexed Tree (Fenwick Tree) - 二分索引木 (Library/DataStructure/BinaryIndexedTree.hpp)
• Cumulative Sum 2D - 二次元累積和 (Library/DataStructure/CumulativeSum2D.hpp)
• Dual Segment Tree - 双対セグメント木 (Library/DataStructure/DualSegmentTree.hpp)
• Lazy Segment Tree - 遅延評価セグメント木 (Library/DataStructure/LazySegmentTree.hpp)
• Merge Sort Tree - 領域木 (Library/DataStructure/MergeSortTree.hpp)
• Rollback Union-Find - Rollback 可能 Union-Find (Library/DataStructure/RollbackUnionFind.hpp)
• Segment Tree - セグメント木 (Library/DataStructure/SegmentTree.hpp)
• Union-Find - 素集合データ構造 (Library/DataStructure/UnionFind.hpp)
• Weighted Union-Find - 重み付き素集合データ構造 (Library/DataStructure/WeightedUnionFind.hpp)
• Bellman Ford - ベルマンフォード法 (Library/Graph/BellmanFord.hpp)
• Cycle Detection - 閉路検出 (Library/Graph/CycleDetection.hpp)
• Dijkstra - ダイクストラ法 (Library/Graph/Dijkstra.hpp)
• Graph - グラフ構造 (Library/Graph/Graph.hpp)
• Graph Utilities - グラフユーティリティ (Library/Graph/GraphMisc.hpp)
• Kruskal - クラスカル法 (Library/Graph/Kruskal.hpp)
• Low Link - 関節点と橋 (Library/Graph/LowLink.hpp)
• Strongly Connected Components - 強連結成分分解 (Library/Graph/StronglyConnectedComponents.hpp)
• Warshall Floyd - ワーシャルフロイド法 (Library/Graph/WarshallFloyd.hpp)
• Library/Other/Compress.hpp
• Longest Increasing Subsequence - 最長増加部分列 (Library/Other/LongestIncreasingSubsequence.hpp)
• Trie - トライ木 (Library/String/Trie.hpp)
• Z Algorithm (Library/String/ZAlgorithm.hpp)
• Template - ユーティリティ関数群 (Library/Template.hpp)
• Library/TemplateExtend.hpp
• Heavy Light Decomposition - 重軽分解 (Library/Tree/HeavyLightDecomposition.hpp)
• Lowest Common Ancestor - 最小共通祖先 (Library/Tree/LowestCommonAncestor.hpp)
• Rerooting DP - 全方位木DP (Library/Tree/RerootingDP.hpp)
• Tree - 木 (Library/Tree/Tree.hpp)
• Tree Diameter - 木の直径 (Library/Tree/TreeDiameter.hpp)
• modint (Library/modint.hpp)
• Library/origin.cpp
• Library/unauthenticated/AuxiliaryTree.hpp
• Library/unauthenticated/EulerTour.hpp
• Functional Graph (Library/unauthenticated/FunctionalGraph.hpp)

Verified with

• verify/AOJ-0560.test.cpp
• verify/AOJ-0723.test.cpp
• verify/AOJ-ALDS1-7-A.test.cpp
• verify/AOJ-DSL-1-A.test.cpp
• verify/AOJ-DSL-1-B.test.cpp
• verify/AOJ-DSL-2-A.test.cpp
• verify/AOJ-DSL-2-B.test.cpp
• verify/AOJ-DSL-2-G.test.cpp
• verify/AOJ-DSL-5-B.test.cpp
• verify/AOJ-GRL-1-A.test.cpp
• verify/AOJ-GRL-1-B.test.cpp
• verify/AOJ-GRL-1-C.test.cpp
• verify/AOJ-GRL-3-A.test.cpp
• verify/AOJ-GRL-3-B.test.cpp
• verify/AOJ-GRL-3-C.test.cpp
• verify/AOJ-GRL-4-A.test.cpp
• verify/AOJ-GRL-5-A.test.cpp
• verify/AOJ-GRL-5-B.test.cpp
• verify/AOJ-GRL-5-C.test.cpp
• verify/LC-CycleDetection.test.cpp
• verify/LC-CycleDetectionUndirected.test.cpp
• verify/LC-JumponTree.test.cpp
• verify/LC-LongestIncreasingSubsequence.test.cpp
• verify/LC-LowestCommonAncestor-HLD.test.cpp
• verify/LC-LowestCommonAncestor.test.cpp
• verify/LC-MinimumSpanningTree.test.cpp
• verify/LC-PersistentUnionfind.test.cpp
• verify/LC-PointAddRangeSum.test.cpp
• verify/LC-PointAddRangeSum_BIT.test.cpp
• verify/LC-PointSetRangeComposite.test.cpp
• verify/LC-RangeAddRangeMin.test.cpp
• verify/LC-RangeAffinePointGet.test.cpp
• verify/LC-RangeAffineRangeSum.test.cpp
• verify/LC-RectangleSum.test.cpp
• verify/LC-ShortestPath.test.cpp
• verify/LC-StaticRangeSumWithUpperBound.test.cpp
• verify/LC-StronglyConnectedComponents.test.cpp
• verify/LC-TreeDiameter.test.cpp
• verify/LC-TreePathCompositeSum.test.cpp
• verify/LC-Unionfind.test.cpp
• verify/LC-UnionfindWithPotential.test.cpp
• verify/LC-VertexAddPathSum.test.cpp
• verify/LC-VertexAddSubtreeSum.test.cpp
• verify/LC-VertexSetPathComposite.test.cpp

Code

#pragma once

/**
 * @file Common.hpp
 */

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

using ll = int64_t;
using ull = uint64_t;

constexpr const ll INF = (1LL << 62) - (3LL << 30) - 1;

#line 2 "Library/Common.hpp"

/**
 * @file Common.hpp
 */

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

using ll = int64_t;
using ull = uint64_t;

constexpr const ll INF = (1LL << 62) - (3LL << 30) - 1;

Back to top page