src/contest/template.hpp

• View this file on GitHub
• Last update: 2025-07-17 16:04:21+09:00
• Include: #include "src/contest/template.hpp"

Required by

• src/tree/static-top-tree.hpp

Verified with

• verify/data-structures/line-container/line_add_get_min.test.cpp
• verify/data-structures/segment-tree-beats/range_chmin_chmax_add_range_sum.test.cpp
• verify/flows/general-matching/general_matching.test.cpp
• verify/flows/hopcroft-karp/bipartitematching.test.cpp
• verify/miscellaneous/integral.test.cpp
• verify/number-theory/floor-sum/sum_of_floor_of_linear.test.cpp
• verify/string/manacher/enumerate_palindromes.test.cpp
• verify/string/suffix-array/number_of_substrings.test.cpp
• verify/string/suffix-array/suffixarray.test.cpp
• verify/string/suffix-automaton/number_of_substrings.test.cpp
• verify/string/z-algorithm/zalgorithm.test.cpp
• verify/tree/link-cut-tree/dynamic_tree_vertex_add_path_sum.test.cpp

Code

#pragma once
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
using ll = long long;
using db = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<db>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pdd = pair<db,db>;
const int INF=0x3fffffff;
const ll LINF=0x1fffffffffffffff;
const db DINF=numeric_limits<db>::infinity();
const db EPS=1e-9;
const db PI=acos(db(-1));
 
template<class T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());

#line 2 "src/contest/template.hpp"
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
using ll = long long;
using db = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<db>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pdd = pair<db,db>;
const int INF=0x3fffffff;
const ll LINF=0x1fffffffffffffff;
const db DINF=numeric_limits<db>::infinity();
const db EPS=1e-9;
const db PI=acos(db(-1));
 
template<class T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());

Back to top page