2018年07月_team39

12月 11月 10月 09月 08月 07月 05月 04月 03月 02月 01月

原创 K - Treasure Exploration （最大路径覆盖）

K - Treasure Exploration Have you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experie...

2018-07-28 17:19:13 224

原创 I - Strategic Game （二分图最大匹配的性质）

I - Strategic Game Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He m...

2018-07-28 16:41:10 156

原创 H - Antenna Placement （最小路径覆盖）

H - Antenna Placement The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, i...

2018-07-28 15:32:51 165

原创 G - Oil Skimming ——二分图匹配（匈牙利算法）

G - Oil Skimming Thanks to a certain "green" resources company, there is a new profitable industry of oil skimming. There are large slicks of crude oil floating in the Gulf of Mexico just waiting to ...

2018-07-28 11:24:04 199

原创 F - Rain on your Parade （HK）

F - Rain on your Parade You’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sunny evening, and a soothing wind sends fresh, s...

2018-07-28 09:49:35 254

原创 D - 棋盘游戏（二分匹配）

D - 棋盘游戏小希和Gardon在玩一个游戏：对一个N*M的棋盘，在格子里放尽量多的一些国际象棋里面的“车”，并且使得他们不能互相攻击，这当然很简单，但是Gardon限制了只有某些格子才可以放，小希还是很轻松的解决了这个问题（见下图）注意不能放车的地方不影响车的互相攻击。所以现在Gardon想让小希来解决一个更难的问题，在保证尽量多的“车”的前提下，棋盘里有些格子是可以避开的，也就是说，不...

2018-07-27 10:40:24 265

原创 A - Fire Net (二分图匹配)

A - Fire Net Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. A blockhouse is a sm...

2018-07-26 16:24:08 465

原创 Fire Net —— dfs搜索

Fire Net Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. A blockhouse is a small...

2018-07-26 14:55:15 97

原创 B - 物流运输

B - 物流运输　物流公司要把一批货物从码头A运到码头B。由于货物量比较大，需要n天才能运完。货物运输过程中一般要转停好几个码头。物流公司通常会设计一条固定的运输路线，以便对整个运输过程实施严格的管理和跟踪。由于各种因素的存在，有的时候某个码头会无法装卸货物。这时候就必须修改运输路线，让货物能够按时到达目的地。但是修改路线是一件十分麻烦的事情，会带来额外的成本。因此物流公司希望能够订一个...

2018-07-21 18:12:27 444

原创 Q - Period II

Q - Period II For each prefix with length P of a given string S,if S[i]=S[i+P] for i in [0..SIZE(S)-p-1], then the prefix is a “period” of S. We want to all the periodic prefixs. Input Input cont...

2018-07-20 11:43:30 296

原创 M - Substrings （KMP ——暴力枚举）

M - Substrings You are given a number of case-sensitive strings of alphabetic characters, find the largest string X, such that either X, or its inverse can be found as a substring of any of the given...

2018-07-20 10:04:10 802

原创 J - Simpsons’ Hidden Talents

J - Simpsons’ Hidden Talents Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had. Marge: Yeah, what is it? Homer: Take me for example. I want to find o...

2018-07-18 11:45:53 202

原创 G - Power Strings （KMP——最小循环节）

G - Power Strings Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, ex...

2018-07-17 15:46:11 190

原创 A - Number Sequence （KMP）

A - Number Sequence Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which m...

2018-07-17 09:03:25 867

原创 Just a Hook ——线段树（区间更新）

Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 40459 Accepted Submission(s): 19558Problem Description In the game of DotA, Pudge’...

2018-07-14 16:28:21 127

转载 Quick Search —— 快速匹配字符串

注：正确性有待考察，因为没有题试试水转载： https://blog.csdn.net/superhackerzhang/article/details/6432559 算法说明：令模式串为p={p[0],p[1],...,p[m-1]},长度为m。文本串为T={T[0],T[1],...,T[n-1]},长度为n.要求n>=m. 令k为p在T上的对齐位置...

2018-07-14 15:36:19 1808

原创 Constructing Roads（prime算法）

Constructing RoadsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 27201 Accepted: 11969DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such t...

2018-07-14 11:33:03 200

原创赛场小知识及注意事项

小知识： 1、从0开始计数，到n-1循环，则循环为 i%n；从1开始计数，到n循环，则循环为 i%n+1；注意事项： 1、及时注意每一个所开数组大小。 2、输入、输出的类型与数的定义类型是否匹配； 3、取模要数好零的个数。 4、在计算几何问题中，要尝试多种方法。每种方法的精度不同。...

2018-07-14 11:03:17 243

原创不敢称为C++的C++课程设计

C++之职工管理系统介绍：此设计只涉及了部分C++知识，大多是面向过程的C语言知识。可以说是用C语言的思想编写的。心得：既然已经花费时间在这件事情上，就应该把这件事情做到最好！！！省去返工的时间。只是想做个纪念。。。代码： #include<conio.h> #include<cstdio> #include<string...

2018-07-14 10:58:37 189 2