关闭

USACO注册以及使用

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

Codeforces Round #436 (Div. 2) A-D题解

Codeforces Round #436 (Div. 2) A. Fair Game B.Polycarp and Letters C. Bus D. Make a Permutation!...
阅读(302) 评论(0)

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 ...
阅读(335) 评论(0)

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}S ​1 ​​ , S_{2}S ​2 ​​ ,\ldots…,S_{M}S ​M ​​ are MM sets over UU. Given a positive constant \alphaα, 0<\alpha \leq 10<α≤1, a subset BB (B \neq 0B≠0) is...
阅读(367) 评论(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,...
阅读(384) 评论(0)

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...
阅读(701) 评论(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...
阅读(639) 评论(0)

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...
阅读(658) 评论(0)

BZOJ 1012 [JSOI2008]最大数maxnumber (单调栈)

1012: [JSOI2008]最大数maxnumber Time Limit: 3 Sec Memory Limit: 162 MB Submit: 11124 Solved: 4868 [Submit][Status][Discuss] Description   现在请求你维护一个数列,要求提供以下两种操作:1、 查询操作。语法:Q L 功能:查询当前数列中末尾L 个数中的最大的数,并输出这个数的值。限制:L不超过当前数列的长度。2、 插入操作。语法:A n 功能:将n加 上t,其中t是最近一...
阅读(192) 评论(0)

Codeforces Round #435 (Div. 2) A-C题解+D代码

Codeforces Round #435 (Div. 2) A.Mahmoud and Ehab and the MEX B. Mahmoud and Ehab and the bipartiteness C.Mahmoud and Ehab and the xor D.Mahmoud and Ehab and the binary string...
阅读(247) 评论(0)

BZOJ 1911 [Apio2010]特别行动队 (斜率优化DP)

1911: [Apio2010]特别行动队 Time Limit: 4 Sec Memory Limit: 64 MB Submit: 4841 Solved: 2362 [Submit][Status][Discuss] Description Input Output Sample Input 4 -1 10 -20 2 2 3 4 Sample Output 9 HINT...
阅读(201) 评论(0)

BZOJ 1010 [HNOI2008]玩具装箱toy (斜率优化DP)

1010: [HNOI2008]玩具装箱toy Time Limit: 1 Sec Memory Limit: 162 MB Submit: 11388 Solved: 4801 [Submit][Status][Discuss] Description   P教授要去看奥运,但是他舍不下他的玩具,于是他决定把所有的玩具运到北京。他使用自己的压缩器进行压 缩,其可以将任意物品变成一堆,再放到一种特殊的一维容器中。P教授有编号为1...N的N件玩具,第i件玩具经过 压缩后变成一维长度为Ci.为了方便整...
阅读(359) 评论(0)

HDU 3507 Print Article (斜率优化DP)

Print Article Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 13922 Accepted Submission(s): 4317 Problem Description Zero has an old printer that doesn't work well sometimes. As it is antique,...
阅读(293) 评论(0)

Codeforces Round #434 (Div. 1, based on Technocup 2018 Elimination Round 1) A-C题解

C. Did you mean... time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Beroffice text editor has a wide range of features that help working with text. One of the features is an automatic search for typos...
阅读(418) 评论(0)

2017 ACM/ICPC Asia Regional Qingdao Online HDU 6214 Smallest Minimum Cut(最小割的边数)

Smallest Minimum Cut Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 234 Accepted Submission(s): 64 Problem Description Consider a network G=(V,E) with source s and sink t. An s-t cut is a part...
阅读(433) 评论(0)
27条 共2页1 2 下一页 尾页
    个人资料
    • 访问:35285次
    • 积分:1603
    • 等级:
    • 排名:千里之外
    • 原创:128篇
    • 转载:1篇
    • 译文:0篇
    • 评论:13条
    联系方式
    欢迎谈论交流:1245985209
    博客专栏
    最新评论