- 博客(27)
- 资源 (2)
- 收藏
- 关注
原创 2018湖南湘潭CCPC邀请赛 && HDU6282: G. String Transformation(思维题)
String TransformationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 553 Accepted Submission(s): 175Problem DescriptionBobo has a s...
2018-08-26 21:03:19 538
原创 2018湖南湘潭CCPC邀请赛 && HDU6285: J. Vertex Cover(计数)
Vertex CoverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 196 Accepted Submission(s): 69Problem DescriptionAlice and Bobo are pla...
2018-08-26 20:52:22 1038
原创 2018湖南湘潭CCPC邀请赛 && HDU6278: C. Just h-index(主席树)
Just h-indexTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 548 Accepted Submission(s): 256Problem DescriptionThe h-index of an a...
2018-08-26 20:38:14 432
原创 2018CCPC网络赛 && HDU 6348: A. Buy and Resell(优先队列+贪心)
Buy and ResellTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 480 Accepted Submission(s): 114Problem DescriptionThe Power Cube is u...
2018-08-25 21:13:35 699
原创 2018CCPC网络赛 && HDU 6444: G. Neko's loop(线段树)
Neko's loopTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionNeko has a loop of size n....
2018-08-25 20:05:58 695
原创 Min_25筛(LibreOJ #6053: 简单的函数)
一个简单的问题:求 (i为质数)设小于的质数有t个,其中表示第i个质数再设 (i为质数或者i的最小质因子不小于) 那么有 其中 , 就是答案因为每次S(x, y)都是由S(?, y-1)转移过来,而有效的"?"只有个,所以总体复杂度小于O(n) 第二个问题:已知F(x)是积性函数,且当p为质数时 ,求积性函数很重要的性质(...
2018-08-24 22:01:16 902
原创 最大空凸包模板 && HDU 6219: Empty Convex Polygons
Empty Convex PolygonsTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 543 Accepted Submission(s): 142Problem DescriptionGiven a s...
2018-08-23 21:41:27 922
原创 HDU6223 && 2017沈阳ICPC: G. Infinite Fraction Path(暴力)
Infinite Fraction PathTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2822 Accepted Submission(s): 566Problem DescriptionThe ant ...
2018-08-23 20:21:34 859
原创 2018 Multi-University Training Contest 10: J. CSGO(思维题)
Problem J. CSGOTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionYou are playing CSGO...
2018-08-22 20:05:53 276
原创 2018 Multi-University Training Contest 10: E. TeaTree
Problem E. TeaTreeTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionRecently, TeaTree...
2018-08-22 19:53:36 311
原创 2018 Multi-University Training Contest 9: B. Rikka with Seam(DP)
Rikka with SeamTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 164 Accepted Submission(s): 50Problem DescriptionSeam carving is ...
2018-08-21 01:32:29 512
原创 2018 Multi-University Training Contest 9: A. Rikka with Nash Equilibrium(DP)
Rikka with Nash EquilibriumTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 507 Accepted Submission(s): 210Problem DescriptionNas...
2018-08-21 00:07:51 435
原创 Wannafly挑战赛22:B. 字符路径
题目描述给一个含n个点m条边的有向无环图(允许重边,点用1到n的整数表示),每条边上有一个字符,问图上有几条路径满足路径上经过的边上的字符组成的的字符串去掉空格后以大写字母开头,句号 '.' 结尾,中间都是小写字母,小写字母可以为0个。输入描述:第一行两个整数n,m接下来m行,每行两个整数a,b和一个字符c,表示一条起点为a,终点为b的边,边上的字符是c1 ≤ n, m ≤ 50...
2018-08-18 11:59:57 300 1
原创 Wannafly挑战赛22: C. 多项式(大整数)
题目描述求,其中f和g是关于x的多项式。输入描述:两行,第一行为f,第二行为g。f和g都用一个由小括号 '(' 和 ')' 、加号 '+' 、乘号 '*' 、 'x' 组成的表达式表示,表达式的语法与通常的习惯相同。保证表达式的长度不超过1000。输出描述:若答案为整数x,输出x/1,答案为+,输出1/0,否则输出表示答案的最简分数a/b。 这题爆long lo...
2018-08-17 21:59:15 684
原创 牛客网暑期ACM多校训练营(第九场)H. Prefix Sum(CDQ分治)
题目描述Niuniu has learned prefix sum and he found an interesting about prefix sum.Let's consider (k+1) arrays a[i] (0 <= i <= k)The index of a[i] starts from 1. a[i] is always the prefix su...
2018-08-16 17:31:17 600
原创 牛客网暑期ACM多校训练营7: C. Bit Compression(DFS+预处理)
题目描述A binary string s of length N = 2n is given. You will perform the following operation n times :- Choose one of the operators AND (&), OR (|) or XOR (^). Suppose the current string is S = s1...
2018-08-09 19:29:45 271
原创 2018 Multi-University Training Contest 6: L. Pinball(物理)
PinballTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 307 Accepted Submission(s): 126Problem DescriptionThere is a slope on the ...
2018-08-08 22:03:24 230
原创 2018 Multi-University Training Contest 6: A. oval-and-rectangle(数论)
oval-and-rectangleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionPatrick Star find a...
2018-08-08 21:06:23 292
原创 2018 Multi-University Training Contest 6: I. Werewolf(DFS)
WerewolfTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem Description"The Werewolves" is a popul...
2018-08-08 21:02:00 336
原创 Codeforces Beta Round #89 (Div. 2): D. Caesar's Legions(DP)
D. Caesar's Legionstime limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputGaius Julius Caesar, a famous general, loved to line up his so...
2018-08-07 21:02:48 445
原创 2018 Multi-University Training Contest 5: H. Hills And Valleys(DP)
Hills And ValleysTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Special JudgeProblem DescriptionTauren h...
2018-08-06 22:10:21 399
原创 2018ACM上海大都会赛: A. Fruit Ninja(这绝对是道原题+随机)
题目描述Fruit Ninja is a juicy action game enjoyed by millions of players around the world, with squishy,splat and satisfying fruit carnage! Become the ultimate bringer of sweet, tasty destruction with...
2018-08-06 00:26:48 1083
原创 2018ACM上海大都会赛: I. Matrix Game(最小费用最大流)
题目描述At the start of the matrix game, we have an N x M matrix. Each grid has some balls.The grid in (i,j) (0 ≤ i < N, 0 ≤ j < M) has Aij balls.In each operation you can remove one ball from a...
2018-08-06 00:20:25 451 1
原创 Wannafly挑战赛21: C. 大水题(DP)
题目描述现在给你N个正整数ai,每个数给出一“好数程度” gi(数值相同但位置不同的数之间可能有不同的好数程度)。对于在 i 位置的数,如果有一在j位置的数满足 j < i 且 ai=aj,则你可以将位于[i,j]闭区间内的序列评为“好序列”,然后获得∑gk(j≤k≤i)(此闭区间内“好数程度”之和)分数。注意: 在所有情况下,每个数都只能被一个”好序列”包含(只能与其他相应数被评为...
2018-08-03 21:59:43 779
原创 牛客网暑期ACM多校训练营(第五场): F. take(期望+线段树)
题目描述Kanade has n boxes , the i-th box has p[i] probability to have an diamond of d[i] size.At the beginning , Kanade has a diamond of 0 size. She will open the boxes from 1-st to n-th. When she op...
2018-08-02 19:00:39 528
原创 牛客网暑期ACM多校训练营(第五场): A. gpa(01分数规划)
题目描述Kanade selected n courses in the university. The academic credit of the i-th course is s[i] and the score of the i-th course is c[i].At the university where she attended, the final score of he...
2018-08-02 18:51:51 300
原创 2018 Multi-University Training Contest 4: B. Harvest of Apples(分块打表)
一般来讲这种询问100000次,每次线性递推100000的题目都可以用分块/莫队来解决引用下官方题解:其实不用莫队那么麻烦,直接nsqrt分块,然后暴力,具体看程序然后如何O(1)求组合数可以看:https://blog.csdn.net/jaihk662/article/details/52251561 #include<stdio.h>#inc...
2018-08-01 18:09:31 308 3
OpenGL基础学习完整代码(完整场景带优化).zip
2020-09-28
OpenGL基础学习完整代码.zip
2020-08-12
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人