- 博客(27)
- 资源 (9)
- 收藏
- 关注
RSS订阅原创 USACO注册以及使用
心血来潮准备试试USACO，毕竟别人的OI题，毕竟有专门的翻译以及题解网站，链接在这：点击打开链接。。但在A题的过程还是遇到种种种种的麻烦啊！搜也没有什么有效的回复，终于自己琢磨透之后，还是写下这篇文章吧。注册这个网站好像并没有被和谐，不用翻墙也可以进去。注册浪费我好长时间，只需要填一下上面的名字啊什么的，但是，总是显示邮箱非法，因为它要把账号和密码发送到你的邮箱，所以，要你填写正
2017-09-30 12:11:53
6510
2
原创 Codeforces Round #436 (Div. 2) A-D题解
Codeforces Round #436 (Div. 2) A. Fair GameB.Polycarp and LettersC. BusD. Make a Permutation!
2017-09-27 13:19:55
846
原创 2017 ACM-ICPC 亚洲区（南宁赛区）网络赛 A Cache Simulator
Cache memories have been used widely in current microprocessor systems. In this problem, you are asked to write a program for a cache simulator. The cache has the following metrics:1. The cache size is 1 KB (K-byte).2. The cache uses the direct mapped
2017-09-24 19:42:56
799
原创 2017 ACM-ICPC 亚洲区（南宁赛区）网络赛 M. Frequent Subsets Problem （状态压缩）
The frequent subset problem is defined as follows. Suppose UU={1, 2,\ldots…,N} is the universe, and S_{1}S1 , S_{2}S2 ,\ldots…,S_{M}SM are MM sets over UU. Given a positive constant \alphaα, 0<\alpha \leq 10<α≤1, a subset BB (B \neq 0B≠0) is
2017-09-24 17:32:20
957
8
原创 2017 ACM-ICPC 亚洲区（南宁赛区）网络赛 F. Overlapping Rectangles （面积并+线段树）
There are nn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might overlap with each other, and the overlapped areas of these rectangles shall not be counted more than once. For example,
2017-09-24 17:08:23
947
原创 ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 G Bounce （规律）
Bounce时间限制:1000ms单点时限:1000ms内存限制:256MB描述For Argo, it is very interesting watching a circle bouncing in a rectangle.As shown in the figure below, the rectangle is divided into N×M grids, and the circle fits exactly one grid.The bouncing rule is sim
2017-09-24 09:36:49
1474
1
原创 ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 E Territorial Dispute （凸包）
Territorial Dispute时间限制:1000ms单点时限:1000ms内存限制:256MB描述In 2333, the C++ Empire and the Java Republic become the most powerful country in the world. They compete with each other in the colonizing the Mars.There are n colonies on the Mars, numbered from
2017-09-23 20:56:05
1295
原创 ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 A Visiting Peking University
Visiting Peking University时间限制:1000ms单点时限:1000ms内存限制:256MB描述Ming is going to travel for n days and the date of these days can be represented by n integers: 0, 1, 2, …, n-1. He plans to spend m consecutive days（2 ≤ m ≤ n）in Beijing. During these m days
2017-09-23 18:59:42
1311
原创 BZOJ 1012 [JSOI2008]最大数maxnumber （单调栈）
1012: [JSOI2008]最大数maxnumberTime Limit: 3 Sec Memory Limit: 162 MBSubmit: 11124 Solved: 4868[Submit][Status][Discuss]Description 现在请求你维护一个数列，要求提供以下两种操作：1、 查询操作。语法：Q L 功能：查询当前数列中末尾L个数中的最大的数，并输出这个数的值。限制：L不超过当前数列的长度。2、 插入操作。语法：A n 功能：将n加上t，其中t是最近一
2017-09-22 13:08:17
508
原创 Codeforces Round #435 (Div. 2) A-C题解+D代码
Codeforces Round #435 (Div. 2)A.Mahmoud and Ehab and the MEXB. Mahmoud and Ehab and the bipartitenessC.Mahmoud and Ehab and the xorD.Mahmoud and Ehab and the binary string
2017-09-21 17:22:49
909
原创 BZOJ 1911 [Apio2010]特别行动队 (斜率优化DP)
1911: [Apio2010]特别行动队Time Limit: 4 Sec Memory Limit: 64 MBSubmit: 4841 Solved: 2362[Submit][Status][Discuss]DescriptionInputOutputSample Input4 -1 10 -20 2 2 3 4 Sample Output9HINT
2017-09-19 22:00:01
560
原创 BZOJ 1010 [HNOI2008]玩具装箱toy (斜率优化DP)
1010: [HNOI2008]玩具装箱toyTime Limit: 1 Sec Memory Limit: 162 MBSubmit: 11388 Solved: 4801[Submit][Status][Discuss]Description P教授要去看奥运，但是他舍不下他的玩具，于是他决定把所有的玩具运到北京。他使用自己的压缩器进行压缩，其可以将任意物品变成一堆，再放到一种特殊的一维容器中。P教授有编号为1...N的N件玩具，第i件玩具经过压缩后变成一维长度为Ci.为了方便整
2017-09-19 14:58:43
888
原创 HDU 3507 Print Article （斜率优化DP）
Print ArticleTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 13922 Accepted Submission(s): 4317Problem DescriptionZero has an old printer that doesn't work well sometimes. As it is antique,
2017-09-18 20:44:45
807
原创 Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1) A-C题解
C. Did you mean...time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBeroffice text editor has a wide range of features that help working with text. One of the features is an automatic search for typos
2017-09-18 16:43:33
1157
原创 2017 ACM/ICPC Asia Regional Qingdao Online HDU 6214 Smallest Minimum Cut（最小割的边数）
Smallest Minimum CutTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 234 Accepted Submission(s): 64Problem DescriptionConsider a network G=(V,E) with source s and sink t. An s-t cut is a part
2017-09-17 19:21:35
923
原创 计算几何相关（更新中）
1.向量结构体定义点和直线struct point{ double x,y;};struct line{ point a,b;};两点相减求向量，重载 - 运算符struct point{ int x,y; point(){}; //因为有带参的构造函数，下面无法直接定义，所以加一个无参的构造函数 point
2017-09-17 07:53:05
534
3
原创 2017 ACM-ICPC 亚洲区（西安赛区）网络赛 C.Sum
Define the function S(x)S(x) for xx is a positive integer. S(x)S(x) equals to the sum of all digit of the decimal expression of xx. Please find a positive integer kk that S(k*x)\%233=0S(k∗x)%233=0.Input FormatFirst line an integer TT, indicates the num
2017-09-16 20:45:18
883
原创 中石油 4509 keks（贪心）
4509: keks时间限制: 1 Sec 内存限制: 128 MB提交: 19 解决: 4[提交][状态][讨论版]题目描述给出一个n位数，要求删掉其中k位数字，使得剩下的数字组成的数尽量大。输入第1行：两个正整数n, k(1 <= k < n <= 500,000)。第2行：一个n位正整数（无前导0）。输出输出一行，一个正整数，表示剩下的数的最大值。样例输入4 21924样例输出94
2017-09-15 21:41:37
415
原创 POJ 1269 Intersecting Lines
Intersecting LinesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16736 Accepted: 7213DescriptionWe all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways:
2017-09-12 21:10:45
550
原创 BZOJ 1007: [HNOI2008]水平可见直线
1007: [HNOI2008]水平可见直线Time Limit: 1 Sec Memory Limit: 162 MBSubmit: 7656 Solved: 2929[Submit][Status][Discuss]Description 在xoy直角坐标平面上有n条直线L1,L2,...Ln,若在y值为正无穷大处往下看,能见到Li的某个子线段,则称Li为可见的,否则Li为被覆盖的.例如,对于直线:L1:y=x; L2:y=-x; L3:y=0则L1和L2是可见的,L3是被覆
2017-09-12 17:43:27
545
原创 POJ 2318 TOYS (向量叉乘+二分）
TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16287 Accepted: 7821DescriptionCalculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their child John never puts his toys away when he
2017-09-11 20:39:58
614
原创 NEU 1008 Friends number
1008: Friends number时间限制: 1 Sec 内存限制: 128 MB提交: 715 解决: 214[提交][状态][讨论版]题目描述Paula and Tai are couple. There are many stories between them. The day Paula left by airplane, Tai send one message to telephone 2200284, then, everything is changing… (
2017-09-08 21:34:41
652
原创 BZOJ 1024 生日快乐 (dfs)
传送门：点击打开链接1024: [SCOI2009]生日快乐Time Limit: 1 Sec Memory Limit: 162 MBSubmit: 2885 Solved: 2101[Submit][Status][Discuss]Description windy的生日到了，为了庆祝生日，他的朋友们帮他买了一个边长分别为 X 和 Y 的矩形蛋糕。现在
2017-09-07 21:37:41
774
原创 Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises) A—C题解
传送门：点击打开链接A. Fractiontime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputPetya is a big fan of
2017-09-07 19:57:26
787
原创 BZOJ 1003 物流运输 (spfa+dp)
传送门：点击打开链接1003: [ZJOI2006]物流运输Time Limit: 10 Sec Memory Limit: 162 MBSubmit: 8310 Solved: 3493[Submit][Status][Discuss]Description 物流公司要把一批货物从码头A运到码头B。由于货物量比较大，需要n天才能运完。货物运输过程中一般要
2017-09-07 11:30:28
767
原创 BZOJ 1001 狼抓兔子 （最大流）
这里是传送门1001: [BeiJing2006]狼抓兔子Time Limit: 15 Sec Memory Limit: 162 MBSubmit: 24044 Solved: 6079[Submit][Status][Discuss]Description现在小朋友们最喜欢的"喜羊羊与灰太狼",话说灰太狼抓羊不到，但抓兔子还是比较在行的，而且现在的兔
2017-09-05 16:07:46
661
原创 Codeforces Round #430 (Div. 2) 签到题
传送门：点击打开链接A. Kirill And The Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKirill plays a new c
2017-09-01 19:06:58
843
数据结构之树状数组讲解
2018-07-27
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人