Ever_glow-CSDN博客

原创 HDU 5115 Dire Wolf (区间DP)

Dire WolfTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 2761 Accepted Submission(s): 1632Problem DescriptionDire wolves, also known as Dark wolves, are extraordinarily large and powerful

2017-10-14 18:39:50 711

原创 BZOJ 1072 [SCOI2007]排列perm (状态压缩+dp+同余定理)

1072: [SCOI2007]排列permTime Limit: 10 Sec Memory Limit: 128 MBSubmit: 2537 Solved: 1583[Submit][Status][Discuss]Description　　给一个数字串s和正整数d, 统计s有多少种不同的排列能被d整除（可以有前导0）。例如123434有90种排列能被2整除，其中末位为2的有30种，末位为4的有60种。Input　　输入第一行是一个整数T，表示测试数据的个数，以下每行一组s

2017-10-09 17:35:57 646

原创 Codeforces Round #439 (Div. 2) A-C题解

A. The Artful Expedienttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRock... Paper!After Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyom

2017-10-07 09:50:55 1568

原创 Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined) A-C题解

A. Bark to Unlocktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs technologies develop, manufacturers are making the process of unlocking a phone as user-friendly as possible. To unlock its new p

2017-10-05 21:10:08 1702

原创 USACO Milking Cows (模拟)

Milking CowsThree farmers rise at 5 am each morning and head for the barn to milk three cows. The first farmer begins milking his cow at time 300 (measured in seconds after 5 am) and ends at time 1000. The second farmer begins at time 700 and ends at time

2017-10-05 13:30:10 888

原创 HDU 6063 RXD and math (数论+快速幂)

RXD and mathTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1363 Accepted Submission(s): 747Problem DescriptionRXD is a good mathematician.One day he wants to calculate:∑i=1nkμ2(i)×⌊nki−

2017-10-05 10:55:19 735

原创 HDU 5514 Frogs （容斥+数论)

FrogsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2810 Accepted Submission(s): 904Problem DescriptionThere are m stones lying on a circle, and n frogs are jumping over them.The stones ar

2017-10-02 17:04:04 1036

原创 USACO注册以及使用

心血来潮准备试试USACO，毕竟别人的OI题，毕竟有专门的翻译以及题解网站，链接在这：点击打开链接。。但在A题的过程还是遇到种种种种的麻烦啊！搜也没有什么有效的回复，终于自己琢磨透之后，还是写下这篇文章吧。注册这个网站好像并没有被和谐，不用翻墙也可以进去。注册浪费我好长时间，只需要填一下上面的名字啊什么的，但是，总是显示邮箱非法，因为它要把账号和密码发送到你的邮箱，所以，要你填写正

2017-09-30 12:11:53 6549 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 871

原创 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 810

原创 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 966 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 961

原创 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 1498 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 1312

原创 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 1344

原创 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 518

原创 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 957

原创 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 576

原创 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 906

原创 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 830

原创 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 1187

原创 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 942

原创计算几何相关（更新中）

1.向量结构体定义点和直线struct point{ double x,y;};struct line{ point a,b;};两点相减求向量，重载 - 运算符struct point{ int x,y; point(){}; //因为有带参的构造函数，下面无法直接定义，所以加一个无参的构造函数 point

2017-09-17 07:53:05 548 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 901

Camelot.pptx

卷积神经网络.pptx

数据结构之树状数组讲解

空空如也