- 博客(43)
- 收藏
- 关注
RSS订阅原创 HDU 5544 (独立回路 高斯消元)
Ba Gua ZhenTime Limit: 6000/4000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 330 Accepted Submission(s): 102Problem DescriptionDuring the Three
2016-04-28 15:09:10
1005
原创 BZOJ 3289 (莫队算法+树状数组)
3289: Mato的文件管理Time Limit: 40 Sec Memory Limit: 128 MBSubmit: 1671 Solved: 732[Submit][Status][Discuss]DescriptionMato同学从各路神犇以各种方式（你们懂的）收集了许多资料，这些资料一共有n份，每份有一个大小和一个编号。为了防止他人偷拷，这些资料都是加密过的
2016-04-28 00:18:07
341
原创 HDU 5145 (莫队算法)
NPY and girlsTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 631 Accepted Submission(s): 197Problem DescriptionNPY's girlfrie
2016-04-27 20:55:22
321
原创 HDU 5213 (莫队算法)
LuckyTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 788 Accepted Submission(s): 258Problem DescriptionWLD is always very luc
2016-04-26 23:59:53
444
原创 NBUT 1457 (莫队算法 离散化)
题目链接:点击打开链接[1457] Sona时间限制: 5000 ms 内存限制: 65535 K问题描述Sona, Maven of the Strings. Of cause, she can play the zither.Sona can't speak but she can make fancy music. Her mu
2016-04-26 00:03:11
458
原创 BZOJ 2038 (莫队算法)
2038: [2009国家集训队]小Z的袜子(hose)Time Limit: 20 Sec Memory Limit: 259 MBSubmit: 6232 Solved: 2885[Submit][Status][Discuss]Description作为一个生活散漫的人，小Z每天早上都要耗费很久从一堆五颜六色的袜子中找出一双来穿。终于有一天，小Z再也无法忍受这恼人
2016-04-25 23:01:15
251
原创 codeforces 617E (莫队算法)
E. XOR and Favorite Numbertime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob has a favorite number k and
2016-04-25 21:00:25
424
原创 codeforces 655D (构造)
D. Simple Subsettime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tuple of positive integers {x1, x2, ...,
2016-04-22 16:33:19
377
原创 codeforces 665E (字典树)
E. Beautiful Subarraystime limit per test3 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputOne day, ZS the Coder wrote down an
2016-04-22 16:27:41
844
原创 HDU 3973 (哈希+线段树)
题目链接：点击打开链接题意：给出一个原串和n个询问串，然后m个操作，询问分两种：1：把x位置的字母改变；2：询问[x,y]之间的字符串是不是等于某个询问串。先把每一个询问串的哈希值存到map里面，然后用线段树维护每一个区间的字符串的哈希值，如果需要的串包含左右两个区间，就把右边区间求出的哈希值进左边区间的长度位。#include #include #include #in
2016-04-22 00:10:26
454
原创 HDU 1496 (水题)
题目链接:点击打开链接窝真是个傻逼.直接把第三第四种的数字的组合存下来直接找就好了.#include #include #include #include #include using namespace std;#define maxn 11111#define add 1000000int a, b, c, d;int num1[maxn], cnt1;int n
2016-04-20 17:58:12
408
原创 HDU 2648 (map 水~)
题目链接:点击打开链接题意:每一个东西每天加一点钱,询问每天价格变化后memory的排名.用map随便搞,维护一下原来的价格和加完的价格.#include #include #include #include #include #include #include using namespace std;#define maxn 11111map mp;int n
2016-04-20 16:15:02
327
原创 HDU 4821 (哈希)
题目链接:点击打开链接题意:求一个字符串中子串的个数,子串满足:长度是n*m,并且m个子串分割成的n个串都不同.知道了一个串的哈希值以后向后递推,然后每次枚举开头的点.#include using namespace std;#define seed 131typedef unsigned long long ull;#define maxn 111111int n,
2016-04-20 15:32:33
358
原创 WHU 1622 (哈希)
题目链接：点击打开链接题意：给一个环问能不能从某个地方切开变成一个回文串。前几天跑武汉做的一个题目。正解是用回文串的算法求出最长回文串然后奇偶性瞎搞，但是哈希显然可以搞。每次枚举断点，只要正向哈希值和逆向哈希值一样就可以认为是回文，用前缀和优化一下复杂度O(n)。#include #include #include #include #include #inclu
2016-04-20 00:32:29
196
原创 HDU 1800 (哈希 水~)
题目链接：点击打开链接题意：求某个数字最多出现多少次。最简单的哈希。把前道0去掉。#include #include #include #include #include using namespace std;#define maxn 33typedef unsigned long long ull;#define seed 131#define mod 1
2016-04-19 18:04:23
374
原创 HDU 5550 (DP)
题目链接：点击打开链接题意：有n层楼，每层有两类人，假设是0，1，然后为每一层楼设置一个01属性使得所有人走到自己属性的楼层的距离和最小。容易想到的是dp[i][0/1]表示这一层属性是0/1的情况下1-i层的最小值，但是有个问题就是另一种属性不知道应该去那一层，所以状态转变一下。因为层的属性肯定是连续的0或者1拼接成的，可以设dp[i][0/1]表示这一层属性是0/1的情
2016-04-14 01:20:42
538
原创 HDU 4587 (割点)
TWO NODESTime Limit: 24000/12000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1618 Accepted Submission(s): 502Problem DescriptionSuppose that G
2016-04-12 21:05:50
390
原创 HDU 4586 (数学)
Play the DiceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2213 Accepted Submission(s): 729Special JudgeProblem Description
2016-04-12 20:51:15
287
原创 HDU 3943 (二分+数位DP)
K-th Nya NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 2762 Accepted Submission(s): 869Problem DescriptionArcueid li
2016-04-10 23:07:15
365
原创 hihocoder 1259 (数位DP)
连接:点击打开链接题意:定义g(x)为f(1)到f(n)中模k余n的个数,求出所有g(x)的异或和.坑爹UVA一直报RE然后转向hihocoder就过了~f(2x)=3f(x),f(2x+1)=f(2x)+1.然后发现f(1)到f(n)在三进制下等价于二进制下的1到n,然后就可以用数位DP搞了.这个思想下的转移方程dp(d,m) = dp(d-1, (m-x)%k).#in
2016-04-10 21:38:23
509
原创 codeforces 660D (STL map)
D. Number of Parallelogramstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n points on a pla
2016-04-10 16:09:25
307
原创 codeforces 660C (尺取法 水~)
C. Hard Processtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array a with n elements.
2016-04-10 00:42:00
641
原创 HDU 3652 (数位DP 水~)
Problem DescriptionA wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided by 13. For example, 130 and 2613 are wqb-numbe
2016-04-08 11:00:02
276
原创 HDU 4568 (SPFA 状压DP)
题意：求从外界拿到所有宝藏并且出去的最小花费。先用k次SPFA求出每个宝藏到每个点的最短路径，然后dp(i,j)表示宝藏获得的状态为i，位置在j的最小花费，转移方程就是dp(i,j)=min {dp(i^(1坑点：并没有宝藏拿不到的情况不用考虑；注意-1的格子。#include #include #include #include #include #includ
2016-04-07 23:08:32
384
原创 HDU 4569 (推导)
题意：求一个方程模m^2为0是否有解。因为m是素数，所以方程模m^2为0必然需要方程模m为0，而所有的x(x>=m)模m为0，必然有(x-m)模m为0.所以就可以寻找[0,m-1]中f(x)模m为0的x，然后判断x+m,x+2m....是不是满足。#include #include #include #include #include #include #include
2016-04-07 23:04:02
428
原创 HDU 4565 (数学推导 矩阵快速幂)
So Easy!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3517 Accepted Submission(s): 1136Problem Description A sequence Sn i
2016-04-07 20:35:44
377
原创 NEU 1007 (字典树 DP)
1007: English Game时间限制: 1 Sec 内存限制: 128 MB提交: 294 解决: 64[提交][状态][讨论版]题目描述This English game is a simple English words connection game.The rules are as follows: there are N Eng
2016-04-06 21:33:07
341
原创 HDU 4722 (数位DP 水~)
Good NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3814 Accepted Submission(s): 1213Problem DescriptionIf we sum up every digit of a
2016-04-06 18:44:49
354
原创 HDU 4734 (数位DP)
F(x)Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3315 Accepted Submission(s): 1247Problem DescriptionFor a decimal number x
2016-04-06 18:32:41
268
原创 HDU 4507 (数位DP)
吉哥系列故事——恨7不成妻Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2758 Accepted Submission(s): 829Problem Description 单身! 依然单身！
2016-04-05 23:29:54
391
原创 数位DP 水~
数位DP貌似很弱,先切水的练练手~HDU2089:点击打开链接输出区间里面没有连续62,没有4的数字个数.#include using namespace std;long long n, m;int bit[11], l;int dp[11][2];int dfs (int pos, bool f1, bool f2) {//当前的位数 前一个数是不是6 是不是可以取到
2016-04-05 18:41:38
385
原创 UVALive 7269 (构造)
链接:点击打开链接题意:构造出一个矩阵,使得矩阵含有n条蛇,每条蛇的长度是1到n,并且奇数长度的蛇有奇数个拐弯,偶数长度的蛇有偶数个拐弯.奇数和偶数分开构造,奇数可以是:1357335755577777这样一直构造下去,偶数可以这样:22664466446688888888不断的放右边和放下面.然后预处理每一个蛇的每一个坐标,然后考虑一下
2016-04-04 22:27:05
677
原创 HDU 4849 (最短路 水~)
除了校赛，还有什么途径可以申请加入ACM校队？ Wow! Such City!Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 1453 Accepted Submission(s): 500
2016-04-03 00:17:48
471
原创 HDU 4850 (构造 dfs)
Wow! Such String!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1216 Accepted Submission(s): 401Special JudgeProblem Description
2016-04-02 21:52:50
500
原创 HDU 4856 (bfs 状压DP)
TunnelsTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1925 Accepted Submission(s): 570Problem DescriptionBob is travelling i
2016-04-02 21:44:05
390
原创 HDU 5656 (莫比乌斯反演)
CA Loves GCDTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 61 Accepted Submission(s): 14Problem DescriptionCA is a fine co
2016-04-02 21:38:15
1228
3
原创 codeforces 650C (并查集)
C. Table Compressiontime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Petya is now fond of data compr
2016-04-01 23:27:26
534
原创 HDU 5556 (最大独立集)
Land of FarmsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 320 Accepted Submission(s): 106Problem DescriptionFarmer John an
2016-04-01 19:08:32
3039
原创 codeforces 659F (并查集 bfs)
F. Polycarp and Haytime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputThe farmer Polycarp has a warehouse wit
2016-04-01 16:36:55
696
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人