2017多校联合
文章平均质量分 84
你的微笑依然那样灿烂
这个作者很懒,什么都没留下…
展开
-
2017多校联合一1002/hdu6034Balala Power!(搜索,贪心,排序,大数进制)
Balala Power!题意:n串字母,总长度不超过1e6,让你给出a-z到0-25的映射,使26进制的字符串对应的数字之和最大。解题思路:每个字母所在位置对应权值加和,肯定存不下。但我们只需要26个字母对应值之间的关系即可,开一个数组a[i][j]分别记录字母i在j这个位置上出现了多少次,对于大于26的值进位,这样我们就得到了26原创 2017-07-29 22:10:57 · 459 阅读 · 0 评论 -
2017多校联合第六场1008/hdu 6103
KirinrikiTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1084 Accepted Submission(s): 430Problem DescriptionWe define the dis原创 2017-08-11 13:39:18 · 347 阅读 · 0 评论 -
2017多校联合第七场1010/hdu 6129 Just do it(递推/杨辉三角)
Just do itTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1203 Accepted Submission(s): 702Problem DescriptionThere is a non原创 2017-08-18 15:10:00 · 300 阅读 · 0 评论 -
2017多校联合四1004/hdu6070Dirt Ratio [二分+线段树]
Dirt RatioTime Limit: 18000/9000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1104 Accepted Submission(s): 486Special JudgeProblem Description原创 2017-08-04 15:39:02 · 505 阅读 · 0 评论 -
2017多校2(hdu6045)Is Derek lying?
Is Derek lying?#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define lowbit(x) (x&-x)#def原创 2017-07-28 12:33:49 · 305 阅读 · 0 评论 -
2017 Multi-University Training Contest 2 solutions BY 电子科技大学
1001:首先,我们统计出Derek和Alfia答案相同的题目数量k1和答案不同的题目数量k2. 对于两人答案相同的题目,共有以下两种情况:两人都对b.两人都错 对于两人答案不同的题目,共有以下三种情况: c.Derek对Alfia错 d.Alfia对Derek错 e.两人都错 于是我们可以列出一些方程: k1+k2=n a+b=k1 c+d+e=k2 a+c=x a+d=y 又a转载 2017-07-28 12:54:04 · 312 阅读 · 0 评论 -
2017多校联合二1003(hdu6047)Maximum Sequence
Maximum Sequence预处理:a_i -= i ,易证明从最小的b开始选每次选最大的一定可以使结果最大。 证明思路:如果条件改为a_i<=max{a_j-j|b_k<=j<=n},那么b的顺序与最后的结果无关。条件改回来后,由于每次要计算一个数的最大值时都有a_(n+1)...a_(i-1)在范围中,所以每次只需让a_i - i尽可能大,那么就把大的数尽早用上,每次一定考虑尽量多原创 2017-07-29 11:04:06 · 329 阅读 · 0 评论 -
Fast IO输入输出加速外挂
namespace fastIO{#define BUF_SIZE 100000 //fread -> read bool IOerror = 0; inline char nc() { static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE; if(原创 2017-08-25 10:37:31 · 1122 阅读 · 0 评论 -
2017多校联合第十场/HDU 6180 Schedule (贪心)
Description给出n个加工任务的开始时间和结束时间,问最少要用多少台机器可以完成这些任务,同一台机器上的任务时间不能有重叠,但允许守尾相接。Input第一行给出用例组数TT,对于每组用例,第一行给出任务数量nn,接下来nn行,每行给出两个整数,表示任务的开始时间和结束时间。1⩽T⩽1001⩽T⩽100,1⩽n⩽1051⩽n⩽105。Output对原创 2017-08-25 14:22:10 · 451 阅读 · 0 评论 -
2017多校联合第十场/HDU 6171 Admiral 双向bfs + 哈希
AdmiralTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others)Total Submission(s): 334 Accepted Submission(s): 105Problem DescriptionSuppose that you a原创 2017-08-25 15:37:16 · 689 阅读 · 1 评论 -
2017多校联合第9场1010 Two String/hdu 6170(正则表达式/dp)
Two stringsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 680 Accepted Submission(s): 269Problem DescriptionGiving two strin原创 2017-08-23 09:00:18 · 650 阅读 · 1 评论 -
2017多校联合第九场/hdu6162(树链剖分)
Ch’s giftTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1287 Accepted Submission(s): 473Problem DescriptionMr. Cui is workin原创 2017-08-28 11:12:22 · 317 阅读 · 0 评论 -
2017多校联合第八场/hdu 6133 Army Formations(线段树合并)
Army FormationsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 894 Accepted Submission(s): 221Problem Description> Stormtroop原创 2017-08-29 10:54:56 · 552 阅读 · 0 评论 -
2017多校联合第三场/hdu6059 Kanade's trio(tire tree)
Kanade's trioTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1079 Accepted Submission(s): 398Problem DescriptionGive you an转载 2017-08-30 22:22:51 · 271 阅读 · 0 评论 -
2017多校联合第六场String/hdu 6096 (tire tree/ac自动机)
StringTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1053 Accepted Submission(s): 339Problem DescriptionBob has a dictiona原创 2017-08-31 10:27:12 · 307 阅读 · 0 评论 -
2017多校联合第四场/HDU 6068 Classic Quotation(kmp+dp)
Description 给出一个长度为n的字符串S和一个长度为m的字符串T,有q次查询,每次查询给出一个区间[L,R],求对所有1Input 第一行一整数T表示用例组数,每组用例首先输入三个整数n,m,q分别表示S串串长和T串串长以及查询次数,之后输入串S和串T,两个串均由小写字母构成,最后q行每行输入两个整数L,R表示一次查询 (1Output 对于每次查询,输出查询结果转载 2017-08-31 19:54:39 · 281 阅读 · 0 评论 -
2017多校联合第7场/hdu 6121 Build a tree(K叉树的异或和)+满K叉树的性质总结
Build a treeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 937 Accepted Submission(s): 366Problem DescriptionHazelFan want原创 2017-08-18 09:54:19 · 1643 阅读 · 2 评论 -
2017多校联合第五场1001/hdu6085Rikka with Candies(bitset)
Rikka with CandiesTime Limit: 7000/3500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1389 Accepted Submission(s): 606Problem DescriptionAs we kn原创 2017-08-11 12:34:36 · 803 阅读 · 0 评论 -
2017多校联合(hdu6043)KazaQ's Socks找规律
KazaQ's Socks题意:一共n双袜子编号1~n,每天早上选取编号最小的一双穿, 当晚上发现只剩一双袜子能穿时,把之前的袜子都洗了, 明天晚上就可以穿了。 问第k天穿的是编号为几的袜子 思路: 规律题,以四双为例,穿袜子的序列为: [1 2 3 4] [1 2 3] [1 2 4] [1 2 3]…[...]……… 前n天 就是相应编号原创 2017-07-26 15:48:03 · 370 阅读 · 0 评论 -
2017多校联合二1011/hdu6055Regular polygon计算几何+思维+暴力枚举
Regular polygonTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2009 Accepted Submission(s): 798Problem DescriptionOn a two-di原创 2017-07-29 22:30:35 · 389 阅读 · 0 评论 -
2017多校联合一/hdu6040Hints of sd0061
Hints of sd0061Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2311 Accepted Submission(s): 693Problem Descriptionsd0061, t原创 2017-08-01 10:11:33 · 420 阅读 · 0 评论 -
2017 Multi-University Training Contest 5 solutions BY 吉如一
2017 Multi-University Training Contest 5 solutions BY 吉如一发表回复出题时难度安排大概是:Easy: 06,08,1106,08,11。Medium-Easy:01,0901,09。Medium:02,04,0702,04,07。Medium-Hard:03,05,1003,05,10。转载 2017-08-08 17:12:48 · 1144 阅读 · 0 评论 -
2017多校联合三/hdu6063 ( RXD and math )快速幂+思维
RXD and mathTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 310 Accepted Submission(s): 160Problem DescriptionRXD is a good原创 2017-08-01 21:11:22 · 904 阅读 · 1 评论 -
2017多校联合三/hdu6066RXD's date大水题
RXD's dateTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 163 Accepted Submission(s): 131Problem DescriptionAs we all know原创 2017-08-01 21:13:31 · 431 阅读 · 0 评论 -
2017 Multi-University Training Contest 3 solutions BY 洪华敦
2017 Multi-University Training Contest 3 solutions BY 洪华敦1001考虑容斥,枚举哪些限制强制不满足,把n减去这些不满足限制的和,然后计算组合数. 注意到组合数有点难算,注意到可以把组合数看成一个mm阶多项式,就可以把问题转换成对每一个1\leq k\leq m1≤k≤m计算kk次方的和. 如果c=1c=1,可以数位dp转载 2017-08-01 21:15:39 · 699 阅读 · 0 评论 -
hdu 6058/2017多校联合第三场Kanade's sum(链表!)
Kanade's sumTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1456 Accepted Submission(s): 581Problem DescriptionGive you an ar原创 2017-08-02 14:17:44 · 426 阅读 · 0 评论 -
2017多校联合第五场1011/hdu6095Rikka with Competition(排序)
Rikka with CompetitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 396 Accepted Submission(s): 328Problem DescriptionAs we原创 2017-08-09 16:02:46 · 478 阅读 · 0 评论 -
2017多校联合第五场1006/hdu6090Rikka with Graph(思维公式)
Rikka with GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 592 Accepted Submission(s): 353Problem DescriptionAs we know,原创 2017-08-09 16:07:11 · 344 阅读 · 0 评论 -
2017 Multi-University Training Contest 1 solutions BY 北京航空航天大学
1001. Add More Zero答案就是 ⌊log10(2m−1)⌋\left \lfloor \log_{10}(2^m - 1) \right \rfloor⌊log10(2m−1)⌋,注意到不存在 10k=2m10^k = 2^m10k=2m ,所以⌊log10(2m−1)⌋=⌊log102m⌋=⌊mlog102⌋\left \lfloor \l转载 2017-07-26 15:17:36 · 669 阅读 · 0 评论 -
2017多校联合四1011/hdu6077Time To Get Up(模拟)
Time To Get UpTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 235 Accepted Submission(s): 193Problem DescriptionLittle Q's原创 2017-08-03 22:17:26 · 572 阅读 · 0 评论 -
2017多校联合四1009/hdu 6075Questionnaire思维
QuestionnaireTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 217 Accepted Submission(s): 168Special JudgeProblem Description原创 2017-08-03 22:22:05 · 465 阅读 · 0 评论 -
2017 Multi-University Training Contest 4 solutions BY 陈松杨
2017 Multi-University Training Contest 4 solutions BY 陈松杨发表回复1001. Big Integer如果知道k-1k−1个数的个数c_1,c_2,...,c_{k-1}c1,c2,...,ck−1,那么方案数就是:\frac{\left(\sum\limits_{i=1}^{k-1转载 2017-08-03 22:25:12 · 1717 阅读 · 0 评论 -
2017多校联合第8场1008/hdu 6140Hybrid Crystals(思维)
Hybrid CrystalsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 384 Accepted Submission(s): 240Problem Description> Kyber crys原创 2017-08-18 09:36:36 · 341 阅读 · 0 评论 -
HDU 6168 - Numbers 水题 2017 Multi-University Training Contest - Team 9
题目链接: HDU 6168 - Numbers题目大意数组a大小为n, 对于所有i,j,1≤ij≤n, 构成一个新数字a[i]+a[j], 放到b数组中 最后将两个数组混在一起打乱, 给你打乱后的数, 求原来的a数组思路混合数组中最小两个数字一定是a中的数字, 因为没有比它们更小的数字来构成它们 所以用一个multset存储所有数字, 这样每次取出来都转载 2017-09-01 13:59:43 · 242 阅读 · 0 评论