dong_pope的博客

半平面交

dong_pope — Mon, 07 Sep 2020 21:10:04 +0800

#include #include #include using namespace std; const double eps = 1e-8; int Sign(double x) { if (fabs(x) < eps)return 0; return x < 0 ? -1 : 1; } struct Point { double x, y; } ans[505];.

树状数组求最值+单点修改

dong_pope — Tue, 01 Sep 2020 21:27:19 +0800

#include #include using namespace std; const int max_n = 200005; int n, a[max_n], tree[max_n]; inline int low_bit(int x) { return x & -x; } inline void Change(int p, int x) { a[p] = x; for (int i = p; i &l.

可持久化fhq

dong_pope — Tue, 25 Aug 2020 14:35:49 +0800

#include #include #include using namespace std; const int max_n = 5e5 + 5; struct Fhq { int ch[2], val, key, sze; } fhq[max_n * 50]; int tot = 0, root[max_n]; inline int New_Code(int val) { int.

极角排序+凸包

dong_pope — Mon, 17 Aug 2020 13:05:54 +0800

#include #include #include using namespace std; int n; const int MAXN = 1e5 + 5; struct Point { double x, y; } p[MAXN], Stack[MAXN]; int Top = 0; bool cmp1(Point u, Point v) { if (u.y == v.y)retu.

海伦秦九韶

dong_pope — Sat, 15 Aug 2020 19:45:25 +0800

#include #include using namespace std; const double eps = 1e-8; struct Point { double x, y; }; struct Vector { double x, y; }; double Distance(Point A, Point B) { double dx = A.x - B.x; double dy = A.y - B.

模拟退火

dong_pope — Fri, 14 Aug 2020 20:54:28 +0800

#include #include #include using namespace std; const double delta = 0.996; const double eps = 1e-15; double X, Y; struct Point { double x, y; } a[1005], ans; int n; double ans_val = 0; double Min_Va.

两圆相交面积

dong_pope — Fri, 14 Aug 2020 16:50:14 +0800

#include #include using namespace std; const double PI = acos(-1); struct Point { double x, y; }; struct Round { Point o; double r; }; double Cos(double a, double b, double c) { return (a * a + b * b - c *.

逆矩阵

dong_pope — Wed, 12 Aug 2020 20:35:55 +0800

#include #include using namespace std; #define int long long const int mod = 1e9 + 7; int n, a[405][405], b[405][405]; int Power(int q, int c) { if (c == 0)return 1; if (q == 0)return 0; int ans = Power(q .

点分治

dong_pope — Fri, 07 Aug 2020 19:19:23 +0800

#include #include using namespace std; const int max_n = 1e4 + 5; int n, k; struct Edge { int to, next, val; } edge[max_n * 2]; int head[max_n]; int ans = 0; bool vis[max_n]; int mx_son[max_n], sze[max_n]; int F.

三点确定一个圆

dong_pope — Mon, 03 Aug 2020 20:09:54 +0800

struct Point { double x, y; } a[max_n]; struct Round { double r; Point o; bool On_Round(Point p) { return (p.x - o.x) * (p.x - o.x) + (p.y - o.y) * (p.y - o.y) <= r * r; } }; Round Make_Round(Point p) { return {0, p};.

后缀数组

dong_pope — Fri, 17 Jul 2020 20:56:56 +0800

#include #include #include using namespace std; const int max_n = 1e5 + 5; int n, m; char s[max_n]; int des[max_n], d = 0; int Rank[max_n], Sa[max_n], Height[max_n], tax[max_n], tp[max_n]; void Rank_S.

广义后缀自动机

dong_pope — Thu, 09 Jul 2020 12:01:30 +0800

#include #include #include #include using namespace std; const int max_n = 1e6 + 5; char s[max_n]; struct Trie { int ch[26]{}, fth, pos; Trie() { for (int &i:ch)i = 0; .

Manacher

dong_pope — Tue, 02 Jun 2020 20:33:00 +0800

#include #include #include using namespace std; const int max_n = 1e5 + 5; char s[max_n], a[max_n * 2]; int n = 0, t, len[max_n * 2], pre[max_n], suf[max_n]; signed main() { // freopen("in", "r", std.

回文自动机

dong_pope — Tue, 19 May 2020 21:38:00 +0800

#include #include using namespace std; const int max_n = 500005; struct Palindromic_Tree { int next[max_n][26]{}, fail[max_n]{}; //next指针，next指针和字典树类似，指向的串为当前串两端加上同一个字符构成 //fail指针，失配后跳转到fail指针指向的节点 int cnt.

大整型

dong_pope — Fri, 15 May 2020 15:27:54 +0800

#include #include #include using namespace std; #define int long long const int base = 1e18; struct BigInt { int num[1000]{}, len; BigInt() { len = 0; } void Assign(int x) { len = .

高斯消元

dong_pope — Fri, 15 May 2020 11:28:13 +0800

#include using namespace std; int n; double a[105][105], b[105]; signed main() { scanf("%d", &n);//NOLINT for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++)scanf("%lf", &a[i][j]);//NOLINT sc.

高次同余方程

dong_pope — Sun, 26 Apr 2020 18:38:22 +0800

int Power(int q, int n, int p) { if (n == 0)return 1 % p; if (q == 0)return 0; int ans = Power(q * q % p, n / 2, p); if (n & 1)ans *= q;//NOLINT return ans % p; } int BSGS(in...

最小斯坦纳树

dong_pope — Thu, 23 Apr 2020 21:29:32 +0800

#include #include #include using namespace std; const int INF = 0x3f3f3f3f; int n, m, k, start[105], a[15], dp[105][1 << 10];//NOLINT; struct E...

线段树合并

dong_pope — Tue, 21 Apr 2020 20:49:46 +0800

#include #include #include #include using namespace std; const int MAXN = 1e5 + 5; int n, m; struct Edge { int to, next; } edge[MAX...

后缀自动机

dong_pope — Fri, 17 Apr 2020 11:31:28 +0800

#include #include #include using namespace std; const int MAXN = 1e6 + 5; char s[MAXN]; int n = 0; int tot = 1, last = 1; struct Suffix_Automaton {...