競プロのテンプレート

多分面倒臭くなって更新しなくなります。

code: (cpp)

# include <bits/stdc++.h>

# ifndef ngng628_library

# define ngng628_library

# define int Int

# define float Float

# define overload3(_1,_2,_3,name,...) name

# define _step(n) _rep(_,n)

# define _rep(i,n) _repr(i,0,n)

# define _repr(i,b,e) for(int i=(b), i##_len=(e); i<i##_len; ++i)

# define rep(...) overload3(__VA_ARGS__, _repr, _rep, _step)(__VA_ARGS__)

# define _reps(i,n) _reprs(i,1,n)

# define _reprs(i,b,e) for(int i=(b), i##_len=(e); i<=i##_len; ++i)

# define reps(...) overload3(__VA_ARGS__, _reps, _reprs)(__VA_ARGS__)

# define rrep(i,n) for(int i=(int)(n)-1; i>=0; --i)

# define rreps(i,n) for(int i=(n); i>0; --i)

# define all(v) std::begin(v), std::end(v)

# define rall(v) std::rbegin(v), std::rend(v)

# define pb push_back

# define eb emplace_back

# define len(v) (int)std::size(v)

# define eprintf(...) fprintf(stderr, __VA_ARGS__)

using namespace std;

using Int = long long;

using Float = long double;

template<class T> using vec = vector<T>;

using pii = pair<int, int>;

using vi = vec<int>;

using vvi = vec<vi>;

using db = deque<bool>;

using ddb = deque<db>;

constexpr int oo = (1LL<<62)-(1LL<<31);

template<class T> istream& operator >>(istream& is, vec<T>& v) { for (auto& x : v) is >> x; return is; }

template<class T, size_t N> istream& operator >>(istream& is, array<T, N>& v) { for (auto& x : v) is >> x; return is; }

template<class T, class U> istream& operator >>(istream& is, pair<T, U>& p) { return is >> p.first >> p.second; }

template<class T> string join(const vec<T>& v){ stringstream s; for (T t : v) s << ' ' << t; return s.str().substr(1); }

template<class T> ostream& operator <<(ostream& os, const vec<T>& v){ if (len(v)) os << join(v); return os; }

template<class T, class U> ostream& operator <<(ostream& os, const pair<T, U>& p){ return os << p.first << ' ' << p.second; }

template<class T, class U, class V> ostream& operator <<(ostream& os, const tuple<T, U, V>& t){ return os << get<0>(t) << " " << get<1>(t) << " " << get<2>(t); }

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

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

# endif // ngng628_library

int32_t main() {

}

テンプレート後回し

vscodeの調子がいいと上手く動くような気がするんですが…

code: (cpp)

# include <bits/stdc++.h>

# ifdef ngng628_library

int32_t main() {

}

# else

# define int Int

# define float Float

# define overload3(_1,_2,_3,name,...) name

# define _step(n) _rep(_,n)

# define _rep(i,n) _repr(i,0,n)

# define _repr(i,b,e) for(int i=(b), i##_len=(e); i<i##_len; ++i)

# define rep(...) overload3(__VA_ARGS__, _repr, _rep, _step)(__VA_ARGS__)

# define _reps(i,n) _reprs(i,1,n)

# define _reprs(i,b,e) for(int i=(b), i##_len=(e); i<=i##_len; ++i)

# define reps(...) overload3(__VA_ARGS__, _reprs, _reps)(__VA_ARGS__)

# define rrep(i,n) for(int i=(int)(n)-1; i>=0; --i)

# define rreps(i,n) for(int i=(n); i>0; --i)

# define all(v) std::begin(v), std::end(v)

# define rall(v) std::rbegin(v), std::rend(v)

# define pb push_back

# define eb emplace_back

# define len(v) (int)std::size(v)

# define eprintf(...) fprintf(stderr, __VA_ARGS__)

using namespace std;

using Int = long long;

using Float = long double;

template<class T> using vec = vector<T>;

using pii = pair<int, int>;

using vi = vec<int>;

using vvi = vec<vi>;

using vvvi = vec<vvi>;

using db = deque<bool>;

using ddb = deque<db>;

using dddb = deque<ddb>;

constexpr int oo = (1LL<<62)-(1LL<<31);

template<class T, class U> istream& operator >>(istream& is, pair<T, U>& p) { return is >> p.first >> p.second; }

template<class T> istream& operator >>(istream& is, vec<T>& v) { for (auto& x : v) is >> x; return is; }

template<class T, size_t N> istream& operator >>(istream& is, array<T, N>& v) { for (auto& x : v) is >> x; return is; }

template<class T> string join(const vec<T>& v){ stringstream s; for (T t : v) s << ' ' << t; return s.str().substr(1); }

template<class T> ostream& operator <<(ostream& os, const vec<T>& v){ if (len(v)) os << join(v); return os; }

template<class T, class U> ostream& operator <<(ostream& os, const pair<T, U>& p){ return os << p.first << ' ' << p.second; }

template<class T, class U, class V> ostream& operator <<(ostream& os, const tuple<T, U, V>& t){ return os << get<0>(t) << " " << get<1>(t) << " " << get<2>(t); }

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

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

constexpr int ctoi(char c){ return isdigit(c) ? c - '0' : -1; }

constexpr int ceil(int a, int b) { return (a + b - 1) / b; }

template<class T> void sort(T& v){ sort(all(v)); }

template<class T, class Compare> void sort(T& v, Compare comp){ sort(all(v), comp); }

template<class T> void reverse(T& v){ reverse(all(v)); }

template<class T> void unique(T& v){ sort(v); v.erase(unique(all(v)), std::end(v)); }

template <class T = int, class S> T accumulate(const S &v, T init = 0) { return accumulate(std::cbegin(v), std::cend(v), init); }

template <class T = int, class S, class Operation> T accumulate(const S &v, T init, Operation op) { return accumulate(std::cbegin(v), std::cend(v), init, op); }

template<class T> auto max(T& v){ return *max_element(all(v)); }

template<class T> auto min(T& v){ return *min_element(all(v)); }

template<class T> auto lower_bound(T& v){ return lower_bound(all(v)); }

template<class T> auto upper_bound(T& v){ return upper_bound(all(v)); }

template<class T> auto next_permutation(T& v){ return next_permutation(all(v)); }

# define ngng628_library

# include __FILE__

# endif