jinii

分类

未归档(27) 题解(2)

/ 注册

全部文章（共11篇）

最小生成树(kruskal)(prim参考dijkstra)

#include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int,int>; using db = d...

板子最小生成树 kruskal

2025-01-28

0 34

字典树板子

#include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int,int>; using db = d...

板子字典树

2025-01-27

0 28

dijkstra板子

#include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int,int>; using db = d...

板子最短路 dijkstra

2025-01-27

0 25

快读快写

inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); } whil...

板子快读快写

2025-01-27

0 28

高精度模版（高精/高精）

#include<bits/stdc++.h> using namespace std; #define int long long vector<int> exchange(string s){ vector<int> A; int len=s....

板子高精度

2025-01-27

0 27

树状数组板子

#include<bits/stdc++.h> using namespace std; #define int long long #define lowbit(x) (x&-(x)) const int N=1e5; int tree1[N]; int tree2[N]; i...

板子树状数组

2025-01-27

0 33

线段树板子

#include<bits/stdc++.h> using namespace std; // #define int long long const int N=1e5+5; int a[N]; int tree[N<<2]; int tag[N<<2]; in...

板子线段树 RMQ

2025-01-27

0 29

ST板子

#include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int,int>; using db = d...

板子 ST RMQ

2025-01-27

0 32

线性筛板子

#include<bits/stdc++.h> using namespace std; #define int long long const int N=1e8+5; vector<int> ans; bool vis[N]; void init(int n){ ...

板子欧拉筛线性筛

2025-01-27

0 32

时间差板子

bool isLeapYear(int year) { return (year % 4 == 0 && year % 100 != 0) || (year % 400 == 0); } // 计算某年某月某日是该年的第几天 int dayOfYear(int year, ...

板子时间差

2025-01-27

0 24