- 博客(52)
- 收藏
- 关注
原创 Wunder Fund Round 2016 (Div. 1 + Div. 2 combined)-D(DFS)
D. Hamiltonian Spanning Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA group of n cities is connect
2017-10-31 21:18:18 397
原创 POJ 2976-Dropping tests(01分数规划)
Dropping testsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13941 Accepted: 4874DescriptionIn a certain course, you take n tests. If you get ai out of
2017-10-31 09:22:14 357
原创 HDU 5919-Sequence II(主席树)
题意:给你个长为n的序列,m次查询,每次查询该区间中所有种类的数在该区间中第一次出现的位置的中位数是多少(比较绕)题解:主席树模板题,很容易想到其实就是找该区间中有多少种数的变形,因为要找每个数在该区间中第一次出现的位置,所以有个技巧是倒着插入主席树,每插入一个值,将当前数位置的贡献值+1,将之前已经出现过的该数的位置上的贡献值-1即可。#include#include#include
2017-10-30 22:10:28 384
原创 Codeforces Round #340 (Div. 2)-E-XOR and Favorite Number(莫队)
E. XOR and Favorite Numbertime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob has a favorite number k and
2017-10-30 12:47:56 363
原创 Codeforces Round #339 (Div. 2)-D-Skills(二分)
D. Skillstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLesha plays the recently published new version of
2017-10-29 12:36:08 387
原创 Codeforces Round #339 (Div. 2)-C(点到线段的最短距离)
C. Peter and Snow Blowertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPeter got a new snow blower as a N
2017-10-28 22:34:28 465
原创 HDU 5975 Aninteresting game (树状数组)
题意:给你1到n,这个n个数从小到大排列,将这n个数放在相应集合中构成n个集合,每个集合中的数为[i-lowbit(i)+1,i-1]+i有两种查询:(1)集合[a,b]共有多少个数 (2)数字x在几个集合里面题解:一开始是懵逼的,n有1e18这么大,但是有lowbit不免会让我想起树状数组。。。因为对树状数组的原理忘得几乎差不多了,于是又回忆了一发。我们可以将小数列出来看一看
2017-10-28 16:28:18 392
原创 Wannafly挑战赛2-B-Travel(floyd+离散化)
题目描述精灵王国有N座美丽的城市,它们以一个环形排列在Bzeroth的大陆上。其中第i座城市到第i+1座城市花费的时间为d[i]。特别地,第N座城市到第1座城市花费的时间为d[N]。这些道路都是双向的。另外,精灵们在数千年的时间里建造了M座传送门,第i座传送门连接了城市u[i]与城市v[i],并且需要花费w[i]的时间通过(可能有两座传送门连接了同一对城市,也有可能一座传送
2017-10-27 22:48:18 511
原创 Wannafly模拟赛4-C-sum(二进制拆分+树状数组)
题目描述考虑维护一个这样的问题:(1) 给出一个数组A,标号为1~n(2) 修改数组中的一个位置。(3) 询问区间[l,r]中所有子集的位运算and之和mod(109+7)。位运算and即为“pascal中的and”和“C/C++中的&”我们定义集合S={ l , l+1 , ... , r-1 , r}若集合T,T ∩ S = T,则称T为S的子集设f(T)=
2017-10-26 15:48:40 490
原创 Codeforces Round #442 (Div. 2)-E-Danil and a Part-time Job(DFS序+线段树区间更新)
E. Danil and a Part-time Jobtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDanil decided to earn some mon
2017-10-25 22:33:08 507
原创 URAL 1960- Palindromes and Super Abilities (回文树)
题意:按照题目给的字符串的顺序,每次添加一个字符,问你当前本质不同的回文串有多少个?题解:回文数模板题,学了一发大佬的模板:http://blog.csdn.net/u013368721/article/details/42100363#include #include #include #include #include using namespace std;const i
2017-10-19 22:37:25 533
原创 acdream 1234-Two Cylinders(辛普森积分)
Two CylindersSpecial Judge Time Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)Submit Statistic Next ProblemProblem Description In this problem you
2017-10-19 13:45:20 339
原创 BZOJ 2618: [Cqoi2006]凸多边形(半平面交)
2618: [Cqoi2006]凸多边形Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 1688 Solved: 842[Submit][Status][Discuss]Description逆时针给出n个凸多边形的顶点坐标,求它们交的面积。例如n=2时,两个凸多边形如下图:则相交部分的面积为5.233。Inp
2017-10-18 22:13:23 381
原创 BZOJ 4349: 最小树形图(最小树形图->朱刘算法)
4349: 最小树形图Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 379 Solved: 167[Submit][Status][Discuss]Description小C现在正要攻打科学馆腹地------计算机第三机房。而信息组的同学们已经建好了一座座堡垒,准备迎战。小C作为一种高度智慧的可怕生物,早已对同学们的信息了如
2017-10-17 18:56:47 647
原创 Codeforces Round #338 (Div. 2)-D Multipliers(所有因数之积)
D. Multiplierstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAyrat has number n, represented as it's prim
2017-10-16 18:26:37 359
原创 HDU 4609 3-idiots(FFT+容斥)
题意:给你n个边长,从中任意选择三个,问你能组成三角形的概率是多少?(同一个边长只能选择一次)题解:会了FFT,这题就好做多了,首先我们开一个num数组,记录每种长度出现的次数。然后对num数组进行DFT变换,再让其num[i]*num[i],此时数组的意义就是从若干边中选择两条边所能组成相应长度的个数,(不懂的去回顾FFT相关知识),因为我们要构成三角形,因此,我们可以枚举最大边
2017-10-15 14:10:05 358
原创 HDU 1402 A * B Problem Plus(FFT)
题解:题意很简单,但是我们采用大数乘法的话复杂度是O(n^2),一定会超时的。因此需要想一个更优的方法,也就是FFT了。这里就简要介绍一下了(理解不算太透彻)叉解的FFT讲解:https://wenku.baidu.com/view/20c234cf581b6bd97f19eaea.html大佬的FFT讲解:http://blog.csdn.net/acdreamers/article
2017-10-14 23:47:37 439
原创 Wannafly挑战赛1 B Xorto(前缀异或和)
题解:直接求一波前缀和即可,比赛时想到了前缀和,然后放弃了。。。。。好菜#include#include#includeusing namespace std;typedef long long ll;int a[200050],sum[200050],cnt[200050];int main(void){ ll ans=0; int n,i,j; scanf("%d",&
2017-10-13 23:32:03 883
原创 Codeforces Round #337 (Div. 2)-C Harmony Analysis(构造x维正交向量)
C. Harmony Analysistime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe semester is already ending, so Dani
2017-10-13 17:07:03 375
原创 Codeforces Round #336 (Div. 2)-D Zuma(区间DP)
D. Zumatime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputGenos recently installed the game Zuma on his phone
2017-10-13 10:44:56 316
原创 Codeforces Round #336 (Div. 2)-C Chain Reaction(二分+DP)
C. Chain Reactiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n beacons located at distinct p
2017-10-12 23:54:54 396
原创 Wannafly模拟赛3-F 监视任务(贪心+线段树区间更新)
题目链接:https://www.nowcoder.com/acm/contest/13/F题目描述:
2017-10-11 19:39:18 445
原创 Wannafly模拟赛3-B 贝伦卡斯泰露(DFS)
题目描述贝伦卡斯泰露,某种程度上也可以称为古手梨花,能够创造几率近乎为0的奇迹,通过无限轮回成功打破了世界线收束理论。和某民科学者不同,贝伦并不在意世界线收束的那套理论,作为奇迹之魔女,贝伦的爱好只在于品茶。作为品茶的消遣,贝伦正在解一道简单的谜题。给出一个长度为n的数列A
2017-10-10 23:48:39 549
原创 Wannafly模拟赛3 绝对半径2051(尺取)
题目链接:https://www.nowcoder.com/acm/contest/13/E题解:尺取即可,枚举右端点,移动左端点。#include #include #include #include #include #include #include #include
2017-10-10 08:58:33 458
原创 Codeforces Round #335 (Div. 2)-C Sorting Railway Cars(最长上升子序列)
C. Sorting Railway Carstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn infinitely long railway has a tr
2017-10-09 21:55:57 452
原创 Codeforces Round #334 (Div. 2)-D Moodular Arithmetic(置换)
D. Moodular Arithmetictime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs behooves any intelligent schoolboy
2017-10-09 18:31:49 333
原创 Codeforces Round #334 (Div. 2)-C Alternative Thinking(贪心)
C. Alternative Thinkingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKevin has just recevied his disappo
2017-10-09 18:22:36 359
原创 Codeforces Round #333 (Div. 2)-D Lipshitz Sequence(单调栈)
D. Lipshitz Sequencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA function is called Lipschitz conti
2017-10-09 12:48:48 395
原创 Codeforces Round #333 (Div. 2)-C The Two Routes(SPFA)
C. The Two Routestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn Absurdistan, there are n towns (number
2017-10-09 10:51:41 335
原创 Codeforces Round #332 (Div. 2)-D Spongebob and Squares(枚举+递推)
D. Spongebob and Squarestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSpongebob is already tired trying
2017-10-09 09:56:16 294
原创 Codeforces Round #332 (Div. 2)-C Day at the Beach (排序)
C. Day at the Beachtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Squidward, Spongebob and Patric
2017-10-08 22:33:14 315
原创 Codeforces Round #331 (Div. 2)-C-Wilbur and Points(STL容器)
C. Wilbur and Pointstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWilbur is playing with a set of n poin
2017-10-08 21:47:34 399
原创 Codeforces Round #330 (Div. 2)C. Warrior and Archer(博弈)
C. Warrior and Archertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the official contest this problem
2017-10-08 18:55:17 360
原创 POJ 2992 Divisors(求组合数因子个数)
DivisorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12048 Accepted: 3594DescriptionYour task in this problem is to determine the number of divisors
2017-10-08 15:49:08 645
原创 POJ 3358 Period of an Infinite Binary Expansion(欧拉定理)
Period of an Infinite Binary ExpansionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3646 Accepted: 1021DescriptionLet {x} = 0.a1a2a3... be the binary
2017-10-08 14:08:25 865
原创 POJ 2429 GCD & LCM Inverse(Pollard-rho 大整数分解+DFS)
GCD & LCM InverseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16795 Accepted: 3107DescriptionGiven two positive integers a and b, we can easily calcu
2017-10-07 23:49:53 580
原创 POJ 1811 Prime Test(大素数判定+质因数分解)
Prime TestTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 35807 Accepted: 9559Case Time Limit: 4000MSDescriptionGiven a big integer number, you ar
2017-10-07 22:59:38 427
原创 BZOJ 1044: [HAOI2008]木棍分割(二分答案+DP)
1044: [HAOI2008]木棍分割Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 4008 Solved: 1540[Submit][Status][Discuss]Description 有n根木棍, 第i根木棍的长度为Li,n根木棍依次连结了一起, 总共有n-1个连接处. 现在允许你最多砍断m个连接处, 砍完
2017-10-07 20:56:01 822
原创 BZOJ 1050: [HAOI2006]旅行comf(并查集+类似最小生成树K算法)
1050: [HAOI2006]旅行comfTime Limit: 10 Sec Memory Limit: 162 MBSubmit: 3558 Solved: 1985[Submit][Status][Discuss]Description给你一个无向图,N(N一条路径,使得路径上最大边和最小边的比值最小。如果S和T之间没有路径,输出”IMPOSSIBLE”,否
2017-10-07 16:04:53 420
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人