- 博客(23)
- 收藏
- 关注
RSS订阅原创 HDU 6379 Invoker （2019-CCPC-秦皇岛站）DP
InvokerTime Limit: 15000/12000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 586Accepted Submission(s): 100Problem Description在 dota2 中有一个叫做祈求者(Invok...
2019-09-28 21:24:52
571
原创 2019多校第四场 HDU6621 K-th Closest Distance（二分+主席树(可持久化线段树) ）
K-th Closest DistanceTime Limit: 20000/15000 MS (Java/Others)Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 3851Accepted Submission(s): 1368Problem DescriptionYou hav...
2019-09-27 22:12:50
276
1
原创 HDU 6601(2019杭电多校二 1011) Keen On Everything But Triangle（主席树 + 组成三角形相关）
Keen On Everything But TriangleTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4879Accepted Submission(s): 1182Problem Descri...
2019-09-27 10:19:36
240
原创 2019ICPC南京网络赛 A.The beautiful values of the palace 离线树状数组或者CDQ分治或者主席树
Here is a square matrix ofn * nn∗n, each lattice has its value (nnmust be odd), and the center value isn * nn∗n. Its spiral decline along the center of the square matrix (the way of spiral decline ...
2019-09-26 15:00:51
198
原创 HDU6609 Find the answer 权值线段树+思维
OJ题号HDU6609 Find the answer简单题意给n个数，前i−1个至少要把几个变成0才能使前i项的和<=m。正解思路思路来自：https://blog.csdn.net/Ratina/article/details/97798320对于每一个a[i],前缀和sum[i]，当sum[i]≤m，则ans[i]=0； 当sum[i]...
2019-09-25 22:20:53
258
原创 ACM好题汇总
本篇博客在距离2019icpc区域赛大约有一个月开始写，主要题目来自18-19HDU多校，当然也会有一些线上比赛的好题，水题签到题目就不整理，整理的为主要为高级思维题和在这之上多一层的算法题1.OJ题号HDU6581简单题意有n+1辆车，属性有长度l,距离终点的距离s,速度v，问你最末尾的车偷到达终点的时间？正解思路思维：如果距离终点远的车如果能...
2019-09-22 23:13:24
3852
原创 __int 128 的输入和输出
输入：inline void read(__int128 &X){ X = 0; int w=0; char ch=0; while(!isdigit(ch)) {w|=ch=='-';ch=getchar();} while(isdigit(ch)) X=(X<<3)+(X<<1)+(ch^48),ch=getchar()...
2019-09-22 10:57:19
644
原创 2019 Multi-University Training Contest 1 D.Vacation 二分或者思维
VacationTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 3015Accepted Submission(s): 1404Special JudgeProblem DescriptionTom and ...
2019-09-21 22:09:49
588
原创 National Contest for Private Universities (NCPU), 2019 （无向图统计简单环个数）
National Contest for Private Universities (NCPU), 2019常见问题题目列表 我的提交 排名：21 问答 A. Minimum Factorial as a Multiple 通过率：80.68% 正确提交 / 总提交：284 / 352 B. Population Count 通过率：93.73% ...
2019-09-21 21:38:04
490
原创 Educational Codeforces Round 73 (Rated for Div. 2)
A 2048 Game standard input/output 1 s, 256 MB x5275 B Knights standard input/output 1 s, 256 MB x3777 C Perfect Team standard input/output...
2019-09-20 10:40:12
1227
原创 The Preliminary Contest for ICPC Asia Shanghai 2019 J. Stone game —— 退背包
CSL loves stone games. He hasnnstones; each has a weighta_iai. CSL wants to get some stones. The rule is that the pile he gets should have a higher or equal total weight than the rest; however ...
2019-09-18 15:40:53
271
原创 2019ccpc与icpc网络赛总结
网络赛总结ccpc一场网络赛，icpc的六场网络赛，接近一个月的时间，收获了不少东西。 这几场网络赛，我们队伍主要采取的策略是两个人做一道题，这样我们把低级错误降到了最低，这几次网络赛基本上wa的都是思路的错误。但我们队伍明显的是出题速度慢，中等思维题还好，但时快时慢，但高等思维题很容易被卡，甚至到做到最后也没出，比如徐州那场的M题我们与出线队伍就差一道这个M题。队伍...
2019-09-18 14:39:50
2779
原创 2019-ACM-ICPC 徐州网络赛 M. Longest subsequence 序列自动机
String is a very useful thing and a subsequence of the same string is equally important.Now you have a stringsswith lengthnnand a stringttwith lengthmm. Find out the longest subsequence in th...
2019-09-12 17:33:53
303
原创 ACM-ICPC 2018 沈阳赛区现场赛 K. Let the Flames Begin （约瑟夫环问题 n个人, 报数为k出环， 第 m 个出圈的人是谁）
来自：https://www.cnblogs.com/scaulok/p/9911819.html题意：n 个人围成一个圈，从 1 开始报到第 k 个人出环，问第 m 个出环的人是谁，n、m、k <= 1e18 且 min（m，k）<= 2e6。题解：约瑟夫环的出队是有O(n)的递推算法的：f(n) = (f(n-1)+k-1)%n+1 约瑟夫环数...
2019-09-12 11:20:44
499
原创 2019南昌网络赛 E. Magic Master （模拟） The 2019 Asia Nanchang First Round Online Programming Contest -
John is not only a magic master but also a shuffling master.Famous though he is, he likes interacting with his fans by playing a game with his fantastic shuffling skills.The game shows as fo...
2019-09-09 21:50:26
150
原创 2019icpc南昌网络赛 G. Colorful String 回文自动机+区间种类数（树状数组）The Preliminary Contest for ICPC Asia Xuzhou 2019
The value of a stringssis equal to the number of different letters which appear in this string.Your task is to calculate the total value of all the palindrome substring.InputThe input consists...
2019-09-07 21:14:56
232
原创 Educational Codeforces Round 72 (Rated for Div. 2)D. Coloring Edges 神仙规律
D. Coloring Edgestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a directed graph withnnvertices andmmdirected ...
2019-09-06 15:03:30
216
原创 Educational Codeforces Round 72 (Rated for Div. 2) C. The Number Of Good Substrings
C. The Number Of Good Substringstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a binary stringss(recall that...
2019-09-06 14:55:31
786
原创 CodeForces 1207 E.XOR Guessing (交互题、位运算)
问题描述这是一个互动的问题。记住，在与测试程序通信时刷新输出。您可以使用c++中的fflush(stdout)、Java中的system.out.flush()、Python中的stdout.flush()或Pascal中的flush(output)来刷新输出。如果使用其他编程语言，请参考它的文档。您也可以参考交互式问题指南:https://codeforces.com/blog/entry/4...
2019-09-05 21:34:04
329
原创 codeforces1027D Number Of Permutations（容斥）
D. Number Of Permutationstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a sequence ofnnpairs of integers:(a...
2019-09-05 17:27:59
217
原创 【Educational Codeforces Round 71 (Rated for Div. 2) F Remainder Problem【分块】
https://codeforces.com/contest/1207/problem/FF. Remainder Problemtime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou are gi...
2019-09-05 15:42:29
317
原创 2019 ICPC南京站网络赛 B super_log和 CodeForces 906D Power Tower(幂塔函数+欧拉降幂模板)
In Complexity theory, some functions are nearlyO(1)O(1), but it is greater thenO(1)O(1). For example, the complexity of a typical disjoint set isO(nα(n))O(nα(n)). Hereα(n)α(n)is Inverse Ackermann...
2019-09-04 20:16:14
266
原创 HDU 6725 Diversity （简单树形DP） 2019百度之星复赛
DiversityTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 27Accepted Submission(s): 19Problem Description给你一棵n个点的树，对于节点i，你要给它标上一个[li...
2019-09-01 09:38:11
235
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人