模板
newhonor
可以不伟大,但不能卑微
展开
-
BM线性递推模板
https://vjudge.net/problem/51Nod-2059#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <vector>#include <string>#include <...原创 2019-10-23 16:36:37 · 132 阅读 · 0 评论 -
string matching
http://acm.hdu.edu.cn/showproblem.php?pid=6629#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#...原创 2019-10-21 19:15:41 · 75 阅读 · 0 评论 -
K Subsequence
http://acm.hdu.edu.cn/showproblem.php?pid=6611总计:最小费用最大流~#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <...原创 2019-10-19 22:50:45 · 140 阅读 · 0 评论 -
Fansblog
http://acm.hdu.edu.cn/showproblem.php?pid=6608威尔逊定理就是对于任意的正质数k,有((k−1)!)%k=k−1#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algo...原创 2019-10-15 09:02:56 · 82 阅读 · 0 评论 -
Important Sisters
http://acm.hdu.edu.cn/showproblem.php?pid=4694题意:以n为出发点,求每个点支配的点的编号和。总结:支配树:https://www.cnblogs.com/fenghaoran/p/dominator_tree.html有一个有向图(可以有环),定下了一个节点为起点s。现在我们要求:从起点s出发,走向一个点p的所有路径中,必须要经过的点...原创 2019-10-12 19:15:28 · 83 阅读 · 0 评论 -
Necklace of Beads POJ - 1286
https://cn.vjudge.net/problem/POJ-1286翻转和选则置换长度2*n;分奇偶看对称轴算循环数;总结:polya计数;#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorit...原创 2019-08-31 10:12:42 · 139 阅读 · 0 评论 -
Gasoline Gym - 101908G
https://cn.vjudge.net/problem/Gym-101908G#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-08-27 12:09:11 · 165 阅读 · 0 评论 -
GCD HDU - 2588
https://cn.vjudge.net/problem/HDU-2588总结:欧拉函数;phi[n]表示小于等于n与n互质的个数;题意:给n,m;求gcd(x,n)>=m(1<=x<=n);思路:设gcd(x,n)==s;令a*s=x,b*s=n;那么gcd(a,b)==1;(不然s可以更大);就是求 b的欧拉值;枚举s;#include <iostr...原创 2019-08-18 09:49:00 · 115 阅读 · 0 评论 -
Country Meow Gym - 101981D
https://cn.vjudge.net/problem/Gym-101981D模拟退火步长更新是差值加delt的k次方。#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include...原创 2019-08-16 17:39:11 · 121 阅读 · 0 评论 -
GCD HDU - 1695
https://cn.vjudge.net/problem/HDU-1695总结:倍数反演:约数反演:#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include &...原创 2019-08-21 09:56:15 · 140 阅读 · 0 评论 -
P4213 【模板】杜教筛(Sum)
https://www.luogu.org/problem/P42131.杜教筛2.min25筛欧拉函数的通项公式:φ(n)=n*(1-1/p1)*(1-1/p2)*(1-1/p3)*(1-1/p4)…..(1-1/pn),其中pi为n的质因数#include <iostream>#include <cstring>#include <queu...原创 2019-08-25 10:09:50 · 109 阅读 · 0 评论 -
Pyramid Gym - 101981G
https://cn.vjudge.net/problem/Gym-101981G思路:暴力处理顶点坐标;暴力数等边三角形;然后找规律;总结:差分推公式;最左边斜的几项0,1,2,3,3,1,0,0....是C(n,m)的系数;http://xueshu.baidu.com/s?wd=paperuri%3A%281d6cf25a905f1951b577cf287a82e1a3...原创 2019-08-15 17:50:24 · 268 阅读 · 0 评论 -
2019中国大学生程序设计竞赛(CCPC) - 网络选拔赛 K-th occurrence
http://acm.hdu.edu.cn/showproblem.php?pid=6704注意后缀数组初始化!!!#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include &l...原创 2019-08-24 19:18:43 · 313 阅读 · 0 评论 -
Hard Equation Gym - 101853G
https://cn.vjudge.net/problem/Gym-101853G#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-09-06 16:15:42 · 294 阅读 · 0 评论 -
Examining the Rooms HDU - 3625
https://cn.vjudge.net/problem/HDU-3625总结:第一类斯特林数;n个数组成k个循环排列;s[i][j]表示i个数组成j个集合(k个无差别盒子):单独一个组成一个集合s[i-1][j-1];插进一个集合中s[i-1][j]*(i-1) 有(i-1)种情况;#include <iostream>#include <cstri...原创 2019-09-07 09:03:09 · 90 阅读 · 0 评论 -
The Preliminary Contest for ICPC Asia Xuzhou 2019 Who is better?
https://nanti.jisuanke.com/t/41383#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#include <...原创 2019-09-08 22:14:37 · 122 阅读 · 0 评论 -
Angle Beats
http://acm.hdu.edu.cn/showproblem.php?pid=6731//#include <iostream>//#include <cstring>//#include <queue>//#include <vector>//#include <algorithm>//#include <c...原创 2019-10-11 13:26:50 · 120 阅读 · 0 评论 -
Georgia and Bob POJ - 1704 阶梯博弈
https://cn.vjudge.net/problem/POJ-1704题意:右边石子可以放到其左边,最后都到地上(0阶梯)无法移动即输;总结:阶梯博弈;奇数堆就是尼姆博弈;#include <iostream>#include <cstring>#include <queue>#include <vector>#incl...原创 2019-09-20 11:15:37 · 146 阅读 · 0 评论 -
Fibonacci again and again HDU - 1848
https://cn.vjudge.net/problem/HDU-1848SG函数:首先定义mex(minimal excludant)运算,这是施加于一个集合的运算,表示最小的不属于这个集合的非负整数。例如mex{0,1,2,4}=3、mex{2,3,5}=0、mex{}=0。SG 定理:游戏的和的 SG 值是各个子游戏的 SG 值的 xor。对于任意状态 x , 定义 SG...原创 2019-09-20 10:23:14 · 95 阅读 · 0 评论 -
The Preliminary Contest for ICPC Asia Shanghai 2019 Stone game
https://nanti.jisuanke.com/t/41420退出当前空位,当作一定取它;总结:退背包;#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <...原创 2019-09-15 21:38:28 · 230 阅读 · 0 评论 -
P5325 【模板】Min_25筛
https://www.luogu.org/problem/P5325总结:min25筛;学习资料:https://www.luogu.org/blog/top-oier/min25-shai-yang-xief`(x)要容易求;(f`(p)==f(p))在质数下取值相同设: 设: G(n)表示比n小的质数的f值...原创 2019-09-12 11:57:23 · 156 阅读 · 0 评论 -
k进制下的快速幂模板
https://cn.vjudge.net/problem/51Nod-1046#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#includ...原创 2019-09-10 21:42:32 · 158 阅读 · 0 评论 -
The 2019 Asia Nanchang First Round Online Programming Contest The Nth Item
https://nanti.jisuanke.com/t/41355歪解:循环节大佬解:k进制快速幂跑q询问;#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include &l...原创 2019-09-08 19:01:49 · 250 阅读 · 0 评论 -
月月查华华的手机
https://ac.nowcoder.com/acm/contest/392/J总结:序列自动机;nex[i][j]表示位置i的字符j在i后第一次在哪里出现;#include <iostream>#include <cstring>#include <queue>#include <vector>#include <al...原创 2019-09-10 09:58:49 · 117 阅读 · 0 评论 -
Control HDU - 4289
https://cn.vjudge.net/problem/HDU-4289#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#include ...原创 2019-08-20 14:50:53 · 151 阅读 · 0 评论 -
Cops And Roobers Gym - 101982E
https://cn.vjudge.net/problem/Gym-101982E#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-08-20 11:11:52 · 170 阅读 · 0 评论 -
C - Milk Patterns POJ - 3261
https://cn.vjudge.net/contest/311974#problem/C总结:后缀数组;lcp(最长公共前缀)sa[i]表示:排名i的串是在那个下标开始(就是是啥串);height[i]表示:排名i和i-1的lcp;即等于LCP(i,i-1)rk[i]表示:下标i开始的串排名是多少;LCP(i,j)=LCP(j,i); LCP(i,i)=len(sa[...原创 2019-08-07 17:02:25 · 122 阅读 · 0 评论 -
石头剪刀布
https://ac.nowcoder.com/acm/contest/949/I总结:高斯消元;A[i][j] 表示第i个方程第j个未知数的系数;n+1是常数项;#include <iostream>#include <cstring>#include <queue>#include <vector>#include <al...原创 2019-07-15 22:26:02 · 111 阅读 · 0 评论 -
P3831 [SHOI2012]回家的路
https://www.luogu.org/problemnew/show/P3831总结:构建分层图!!__gnu_pbds::priority_queue<node>q;快到飞#include <iostream>#include <cstring>#include <queue>#include <vector&g...原创 2019-07-15 17:40:18 · 98 阅读 · 0 评论 -
Wormholes POJ - 3259
https://cn.vjudge.net/problem/POJ-3259总结:spfa判断负环(节点入队最多n-1次,超过n就存在)#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>...原创 2019-07-15 16:13:52 · 112 阅读 · 0 评论 -
P4822 [BJWC2012]冻结
https://www.luogu.org/problemnew/show/P4822#include<bits/stdc++.h>using namespace std;#define sfi(i) scanf("%d",&i)#define sfs(i) scanf("%s",(i))#define pri(i) printf("%d\n",i)#def...原创 2019-07-15 15:39:59 · 442 阅读 · 0 评论 -
P1776 宝物筛选_NOI导刊2010提高(02)
https://www.luogu.org/problemnew/show/P1776总结:多重背包用单调队列优化,原理公式:f[i][j]=max(f[i-1][j-w*k]+v*k);化:f[i][j]=max(f[i-1][d+w*k]-v*k)+v*s; d=j%w(即0~w); s=j/w(即最大更新数量);分析:单调队列前提是下标递增,维护数值单调;那么就是...原创 2019-07-11 09:23:28 · 184 阅读 · 0 评论 -
1047: [HAOI2007]理想的正方形
https://www.lydsy.com/JudgeOnline/problem.php?id=1047思路:二维单调队列求子矩阵最大值最小值的最小差值;ans的判断方错位置,坑自己#include<algorithm>#include<set>#include<cmath>#include<cstring>#include...原创 2019-07-10 21:03:47 · 120 阅读 · 0 评论 -
1342: [Baltic2007]Sound静音问题
https://www.lydsy.com/JudgeOnline/problem.php?id=1342思路:单调队列#include<algorithm>#include<set>#include<cmath>#include<cstring>#include<iostream>#include<set&g...原创 2019-07-10 16:34:06 · 169 阅读 · 0 评论 -
P3812 【模板】线性基
https://www.luogu.org/problemnew/show/P3812总结:线性基异或最大值#include<bits/stdc++.h>using namespace std;#define sfi(i) scanf("%d",&i)#define sfs(i) scanf("%s",(i))#define pri(i) printf("...原创 2019-07-14 17:32:41 · 86 阅读 · 0 评论 -
2460: [BeiJing2011]元素
总结:线性基插入;https://www.lydsy.com/JudgeOnline/problem.php?id=2460#include<bits/stdc++.h>using namespace std;#define sfi(i) scanf("%d",&i)#define sfs(i) scanf("%s",(i))#define pri(i) p...原创 2019-07-14 17:28:26 · 152 阅读 · 0 评论 -
H. Are You Safe?
https://codeforc.es/gym/102219/problem/H思路:判断点是否在凸包内,是则unsafe,包含边上的;总结:非极角排序求凸包;坑:逆时针输出,极角排序顺序不行;#include<algorithm>#include<set>#include<cmath>#include<cstring>#i...原创 2019-07-09 21:26:27 · 372 阅读 · 0 评论 -
3261: 最大异或和
https://www.lydsy.com/JudgeOnline/problem.php?id=3261总结:可持久化字典树;#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#incl...原创 2019-07-18 10:55:53 · 234 阅读 · 0 评论 -
Tree
http://acm.hdu.edu.cn/showproblem.php?pid=4757思路:1.Tarjan求lca ; 2.倍增求lca;#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorit...原创 2019-07-18 16:33:44 · 92 阅读 · 0 评论 -
Connections between cities
http://acm.hdu.edu.cn/showproblem.php?pid=2874/*#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>...原创 2019-07-16 16:47:23 · 113 阅读 · 0 评论