![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
洛谷
木落淮南,雨晴雲夢
这个作者很懒,什么都没留下…
展开
-
高斯消元模板
P2455 [SDOI2006]线性方程组#include <bits/stdc++.h>#include <ext/pb_ds/assoc_container.hpp>#define inf 0x7fffffff#define ll long long//#define int long long//#define double long double#define re int#define void inline void#define eps 1e-6//原创 2022-04-15 19:41:11 · 258 阅读 · 0 评论 -
zjy&xmd&shoes
题目描述zjyzjyzjy学长对于鞋子情有独钟,他买了很多的鞋子,所以zjyzjyzjy学长家里有很多的鞋子。由于zjyzjyzjy学长经常向别人炫耀他的那些鞋子,因此同学们都非常的嫉妒,而xmdxmdxmd就是其中之一。为了让zjyzjyzjy学长感到sadsadsad,xmdxmdxmd决定采取一些必要的行动。在一个月黑风高的夜晚,xmdxmdxmd溜进了zjyzjyzjy学长的家里,并从如山的鞋子了偷走了一只。第二天,xmdxmdxmd在学校见到了zjyzjyzjy学长,并兴高采烈的对他说:“原创 2021-12-12 16:36:25 · 442 阅读 · 0 评论 -
Pollard-Rho模板
P4718 【模板】Pollard-Rho算法这里有两个模板第一个是我的,要开O2才能卡过去,慎用建议用第二个#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long//#define int long long//#define double long double#define re register int#define void inline void#define eps 1e-18//转载 2021-11-26 11:29:54 · 175 阅读 · 0 评论 -
1e13内的素数个数 Meissel–Lehmer 算法
P7884 【模板】Meissel–Lehmer 算法时间复杂度是玄学模板准备#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long//#define int long long//#define double long double#define re register int#define void inline void#define eps 1e-18//#define mod 1e9+7转载 2021-11-19 10:40:15 · 383 阅读 · 0 评论 -
矩阵快速幂模板
#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e9+7;const int M=2e3+5;const int N=1e2+5;//?????????? 4原创 2021-03-23 22:28:09 · 57 阅读 · 0 评论 -
k进制下的异或(模板)
int Xor(int x,int y){ int sum=0,p=1; if(y%2==0) swap(x,y); while(x||y) { sum+=(x%k+y%k)%k*p; p*=k; x/=k; y/=k; } return sum;}转载 2021-07-08 10:56:20 · 112 阅读 · 0 评论 -
exgcd通解
CF7C Line#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff//#define ll long long#define int long long//#define double long double#define re int#define void inline void#define eps 1转载 2021-07-07 22:19:58 · 331 阅读 · 0 评论 -
矩阵加速线性递推
HDU - 6185#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <cstdlib>#include <queue>#include <deque>#include &转载 2021-06-05 12:29:58 · 105 阅读 · 2 评论 -
P4777 【模板】扩展中国剩余定理(EXCRT)
#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e5+7;const int M=1e5;const int N=1e6+5;//空间最大限制 4e8int转载 2021-06-04 21:52:09 · 103 阅读 · 0 评论 -
exgcd
CF898B Proper Nutrition#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double#define re register int#define void inli转载 2021-06-03 21:51:27 · 91 阅读 · 0 评论 -
P3807 【模板】卢卡斯定理
P3807 【模板】卢卡斯定理#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double//#define double long long#define re int//#define void inline void#define eps 1e-8//#define mod 1e9+7#define原创 2021-05-21 16:10:04 · 52 阅读 · 0 评论 -
最小瓶颈路问题 dfs,bfs两个版本(树形)
P2245 星际导航最小瓶颈路:在一张无向图上,对于点 u、v 找出从 u、v 的一条简单路径,使得路径上行所有边中最大值最小。该题目由于是树形,因此可以用与倍增相似的方法求解注意:这道题要判断不连通的情况#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long//#define int long long//#define double long double//#define double long原创 2021-05-20 22:48:49 · 100 阅读 · 0 评论 -
求补图连通块总数及每一块大小(CF920E Connected Components?)
CF920E Connected Components?#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <cstdlib>#include <queue>#include <de转载 2021-05-09 15:58:39 · 133 阅读 · 0 评论 -
求补图连通块总数及每一块大小(CF920E Connected Components?)
CF920E Connected Components?#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <cstdlib>#include <queue>#include <de原创 2021-05-09 15:57:50 · 93 阅读 · 0 评论 -
P4777 【模板】扩展中国剩余定理(EXCRT)
P4777 【模板】扩展中国剩余定理(EXCRT)#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e5+7;const int M=1e5;const in转载 2021-04-02 09:04:20 · 74 阅读 · 0 评论 -
P4777 【模板】扩展中国剩余定理(EXCRT)
P4777 【模板】扩展中国剩余定理(EXCRT)#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e5+7;const int M=1e5;const in原创 2021-04-02 09:03:31 · 54 阅读 · 0 评论 -
单调队列3
P2627 [USACO11OPEN]Mowing the Lawn G#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e4+7;const int M=1e转载 2021-04-02 08:58:50 · 69 阅读 · 0 评论 -
单调队列2
P2034 选择数字#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e5+7;const int M=2147483647;const int N=1e5+转载 2021-04-02 08:55:54 · 65 阅读 · 0 评论 -
单调队列1
P1714 切蛋糕#include <bits/stdc++.h>#define inf 0x7fffffff//#define ll long long//#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e5+7;const int M=2147483647;const int N=5原创 2021-04-02 08:52:15 · 66 阅读 · 0 评论 -
分层图最短路
P4568 [JLOI2011]飞行路线#include <bits/stdc++.h>#pragma GCC optimize(2)#pragma GCC optimize(3,"Ofast","inline")#define inf 0x7fffffff#define ll long long#define eps 1e-5//#define mod 1e9+7using namespace std;const int mod=9987;const int N=4*1e6转载 2021-04-01 18:01:35 · 56 阅读 · 0 评论 -
次短路
P2865 [USACO06NOV]Roadblocks G#include <algorithm>#include <iostream>#include <cstring>#include <cstdio>#include <vector>#include <stack>#include <queue> using namespace std;struct ahah{ int nxt,to,dis;}原创 2021-04-01 17:56:34 · 52 阅读 · 0 评论 -
P2515 [HAOI2010]软件安装
P2515 [HAOI2010]软件安装#include <bits/stdc++.h>#define inf 0x7fffffff//#define ll long long//#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e9+7;const int M=1e5;const in原创 2021-04-01 17:46:15 · 320 阅读 · 0 评论 -
P3805 【模板】manacher算法
链接//#pragma GCC optimize(2)//#pragma GCC optimize(3,"Ofast","inline")#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <cstdlib>#include <queue>#include <deque>#include <a原创 2021-03-28 10:18:13 · 111 阅读 · 0 评论 -
P5490 【模板】扫描线
链接#include <bits/stdc++.h>#define inf 0x7fffffff//#define ll long long#define llu unsigned long long#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e9+7;const int M=2e3原创 2021-03-27 19:46:02 · 101 阅读 · 0 评论 -
P2634 [国家集训队]聪聪可可
超链接#include <bits/stdc++.h>using namespace std;const int N=1e6+5;struct node{ int ver,edge,next;}e[N];int tot=1,head[N];int son[N],sz[N],v[N];int n,root,all;int t[N],d[N];int ans;void add(int x,int y,int z){ e[++tot].ver=y; e[tot].edg原创 2021-03-23 22:30:31 · 69 阅读 · 0 评论 -
P5960 【模板】差分约束算法
题目入口题目描述给出一组包含 mm 个不等式,有 nn 个未知数的形如:的不等式组,求任意一组满足这个不等式组的解。输入格式第一行为两个正整数 n,m,代表未知数的数量和不等式的数量。接下来 mm 行,每行包含三个整数 c,c’,yc,c ′,y,代表一个不等式 x_c-x_{c’}\leq yx c −x c ′ ≤y。输出格式一行,nn 个数,表示 x_1 , x_2 \cdots x_nx1 ,x2 ⋯xn 的一组可行解,如果有多组解,请输出任意一组,无解请原创 2021-03-07 09:38:49 · 204 阅读 · 0 评论 -
SP2878 KNIGHTS - Knights of the Round Table(点双联通分量+奇环判断模板题)
传送门题目描述Being a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights are fun things to do. Therefore, it is not very surprising that in recent years the kingdom of King Arthur ha原创 2021-03-07 09:33:29 · 204 阅读 · 0 评论 -
P1344 [USACO4.4]追查坏牛奶Pollutant Control(ISAP模板)
传送门简单解释一下如何求割的边数(即车数);思路一:先用ISAP在原图中求最小割(即代价),然后将原图中的边权改为1,再求最小割(车数);思路二:因为m<=1000,所以将原图边权改为edge*mod+1(mod为大于1000的任何数),代价即为当前图下的最小割/mod,车数即为当前图下最小割%mod(记得开long long)#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long#define原创 2021-03-06 18:46:33 · 132 阅读 · 0 评论 -
P4782 【模板】2-SAT 问题
传送门关键在于一句话:认为只有其中一个满足要求,不满足要求的指向满足要求的 ,连上两条有向边#include <bits/stdc++.h>#define inf 0x7fffffff#define ll long long//#define int long long//#define double long double#define eps 1e-8//#define mod 1e9+7using namespace std;const int mod=1e9+7;原创 2021-03-06 18:19:14 · 81 阅读 · 0 评论