manor changes

competitive/data_structure/sorted_set.hpp

@@ -151,7 +151,7 @@ template<typename T> struct SortedSet {
             if (x < sz(a[i])) return a[i][x];
             x -= sz(a[i]);
         }
-        return -1;
+        return T();
     }
     Iterator lower_bound(T x) {
         rep(i, sz(a)) {

competitive/geometry/base.hpp

@@ -48,8 +48,10 @@ template<typename T> struct Point {
     T abs() const {return sqrt((*this).norm()); };
     T arg() const {return atan((*this).y / (*this).x); };
     Point<T> rotate(const double &theta) {
-        (*this).x = cos(theta) * (*this).x - sin(theta) * (*this).y;
-        (*this).y = sin(theta) * (*this).x + cos(theta) * (*this).y;
+        double nx = cos(theta) * (*this).x - sin(theta) * (*this).y;
+        double ny = sin(theta) * (*this).x + cos(theta) * (*this).y;
+        (*this).x = nx;
+        (*this).y = ny;
         return (*this);
     };
 

competitive/math/prime.hpp

@@ -1,13 +1,38 @@
 #pragma once
 #include "competitive/std/std.hpp"
-template <class T> bool is_prime(T n) {
+bool is_prime(ll n) {
+    using u128 = __uint128_t;
+    vector<u128> a_list = {2, 7, 61, 325, 9375, 28178, 450775, 9780504, 1795265022};
     if (n == 1) return false;
-    for (T i=2; i <= (T)std::sqrt(n); i++) {
-        if (n % i == 0) return false;
+    if (n == 2) return true;
+    if (n % 2 == 0) return false;
+    ll r = 0;
+    ll d = n - 1;
+    while (!(d & 1)) {
+        d >>= 1;
+        r++;
+    }
+    ll cnt = 0;
+    repe(a, a_list) {
+        if (a >= n) continue;
+        u128 res = 1;
+        ll di = d;
+        while (di > 0) {
+            if (di & 1) res = (res * a) % n;
+            if (di > 1) a = (a * a) % n;
+            di >>= 1;
+        }
+        if (res == 1) continue;
+        bool valid = false;
+        rep(i, r) {
+            if (res == n - 1) valid = true;
+            res = (res * res) % n;
+        }
+        if (!valid) return false;
     }
     return true;
-};
-//return all devisor
+}
+
 template <class T> vector<T> divisor(T n, bool sorted=true) {
     vector<T> ans(0);
     for (T i = 1; i <= (T)std::sqrt(n); i++) {

competitive/std/io.hpp

@@ -1,6 +1,6 @@
 #pragma once
 #include "competitive/std/std.hpp"
-// 演算子オーバーロード（プロトタイプ宣言）
+// overload operators (prototypes)
 template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);
 template <class T> inline istream& operator>>(istream& is, vector<T>& v);
 template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);
@@ -14,7 +14,7 @@ template <typename T> ostream &operator<<(ostream &os, deque<T> q);
 template <typename T> ostream &operator<<(ostream &os, stack<T> st);
 template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);
 
-// 演算子オーバーロード
+// overload operators
 template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
 template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }
 template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << " " << p.second; return os; }
@@ -24,7 +24,7 @@ template <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto
 template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
 template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? " " : ""); } return os; }
 template <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << " "; q.pop(); } return os; }
-template <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front() << " "; q.pop_front(); } return os; }
+template <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front(); q.pop_front(); if (q.size()) os << " "; } return os; }
 template <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << " "; st.pop(); } return os; }
 template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << " "; pq.pop(); } return os; }
 

competitive/std/std.hpp

@@ -7,7 +7,8 @@
 #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 #endif // LOCAL_TEST
 using namespace std;
-// 型名の短縮
+using std::cout;
+// shorten typenames
 using ll = long long;
 using pii = pair<int, int>; using pll = pair<ll, ll>;
 using vi = vector<int>;  using vvi = vector<vi>; using vvvi = vector<vvi>;
@@ -20,35 +21,35 @@ template<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return ve
 template<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }
 template<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); }
 template <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;
-// 定数の定義
+// define CONSTANTS
 constexpr double PI = 3.14159265358979323;
 constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;
-float EPS = 1e-8; double EPSL = 1e-16;
+float EPS = 1e-8; double EPSL = 1e-10;
 template<typename T> bool eq(const T x, const T y) { return x == y; }
-template<> bool eq<double>(const double x, const double y) { return abs(x - y) < EPSL; }
-template<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS; }
+template<> bool eq<double>(const double x, const double y) { return (abs(x - y) < EPSL * x || abs(x - y) < EPSL); }
+template<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS * x; }
 template<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); }
 template<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); }
 template<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); }
 template<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); }
 template<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); }
 constexpr int MODINT998244353 = 998244353;
 constexpr int MODINT1000000007 = 1000000007;
-// 入出力高速化
+// fasten io
 struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;
-// 汎用マクロの定義
+// define macros
 #define all(a) (a).begin(), (a).end()
 #define sz(x) ((ll)(x).size())
-#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0 から n-1 まで昇順
-#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // 0 から n-1 まで昇順
-#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // s から t まで昇順
-#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // s から t まで stepずつ
+#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0,1,...,n-1
+#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // i=0,1,...,n-1
+#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // i=s,s+1,...,t-1
+#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // i=s,s+step,...,<t
 #define overload4(a, b, c, d, e, ...) e
 #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
-#define repe(a, v) for(auto& a : (v)) // v の全要素（変更可能）
-#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod
-#define sdiv(n, m) (((n) - smod(n, m)) / (m)) // 非負div
-#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
+#define repe(a, v) for(auto& a : (v)) // iterate over all elements in v
+#define smod(n, m) ((((n) % (m)) + (m)) % (m))
+#define sdiv(n, m) (((n) - smod(n, m)) / (m))
+#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());}
 int Yes(bool b=true) { cout << (b ? "Yes\n" : "No\n"); return 0; };
 int YES(bool b=true) { cout << (b ? "YES\n" : "NO\n"); return 0; };
 int No(bool b=true) {return Yes(!b);};
@@ -64,7 +65,6 @@ template<typename T> bool in_range(const T& val, const T& s, const T& t) { retur
 template <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }
 template <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }
 
-// modでのpow
 ll powm(ll a, ll n, ll mod=INFL) {
     ll res = 1;
     while (n > 0) {
@@ -74,17 +74,16 @@ ll powm(ll a, ll n, ll mod=INFL) {
     }
     return res;
 }
-// 整数Sqrt
 ll sqrtll(ll x) {
     assert(x >= 0);
     ll rev = sqrt(x);
     while(rev * rev > x) --rev;
     while((rev+1) * (rev+1)<=x) ++rev;
     return rev;
 }
-template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
-template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
-int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } // xのd進数桁数
+template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; }
+template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; }
+int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; }
 /**
  * @brief std.hpp
  * @docs docs/std/std.md