2017年09月_Mr_Treeeee

原创 URAL 1297 - Palindrome（最长回文后缀数组）

1297. PalindromeTime limit: 1.0 secondMemory limit: 64 MBThe “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Un

2017-09-30 18:13:09 295

原创 SPOJ DISUBSTR - Distinct Substrings（不同子串数量后缀数组）

Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TEach test case consists of one string, whose length is OutputFor each test case out

2017-09-29 20:02:59 312

原创 HDU 5980 - Find Small A（进制）

Find Small ATime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1680 Accepted Submission(s): 826Problem DescriptionAs is known to

2017-09-28 19:27:12 325

原创 HDU 5979 Convex （几何）

ConvexTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1080 Accepted Submission(s): 702Problem DescriptionWe have a special co

2017-09-28 19:23:49 287

原创 HDU 5978 To begin or not to begin（概率）

To begin or not to beginTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1226 Accepted Submission(s): 790Problem DescriptionA

2017-09-28 19:18:34 308

原创 HDU 5976 - Detachment （拆数乘法）

DetachmentTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1723 Accepted Submission(s): 481Problem DescriptionIn a highly deve

2017-09-28 19:10:15 377

原创 HDU 5974 A Simple Math Problem(GCD LCM)

A Simple Math ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2801 Accepted Submission(s): 874Problem DescriptionGiven

2017-09-28 19:02:29 302

原创 HDU 5971 Wrestling Match（二分图着色）

Wrestling MatchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1833 Accepted Submission(s): 663Problem DescriptionNowadays, a

2017-09-28 18:57:59 332

原创 POJ 3261 - Milk Patterns （可重叠的k次最长重复子串后缀数组）

Milk PatternsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 16432 Accepted: 7254Case Time Limit: 2000MSDescriptionFarmer John has noticed that th

2017-09-27 22:56:51 321

原创 POJ 1743 Musical Theme（不可重叠最长重复子串后缀数组）

Musical ThemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 30961 Accepted: 10341DescriptionA musical melody is represented as a sequence of N (1<=N<=2

2017-09-27 22:13:51 446 1

原创 UVA 12338 - Anti-Rhyme Pairs（后缀数组+RMQ）

UVA - 12338 可点击。题意：给你n个字符串，q个查询，每个查询问两个字符串的最长公共前缀是几。POINT：后缀数组，把几个字符串合起来。然后RMQ heght数组。注意答案不能超过min(两个字符串的长度)。先给ans赋值一个上限。在去query查询。#include #include #include #include #incl

2017-09-26 23:42:45 319

原创 POJ 2774 Long Long Message（后缀数组）

Long Long MessageTime Limit: 4000MS Memory Limit: 131072KTotal Submissions: 31854 Accepted: 12853Case Time Limit: 1000MSDescriptionThe little cat is majorin

2017-09-26 23:35:29 250

原创 2017 ACM-ICPC 亚洲区（南宁赛区）网络赛 - B F J L M

B. Train Seats Reservation：题意：一辆火车从1开到n，给你几个从l上车，r下车的人数。让你求这辆火车至少要装多少座位才可以都坐下。POINT：数据很小，暴力，求区间1到n里同时人数最多的就行。注意r这个点的人是要下车的，可以同时上车。#include#include #include using namespace std;#defin

2017-09-24 18:19:08 2860 2

原创 2017 ACM-ICPC 亚洲区（北京赛区）网络赛 - A I

题目1 : 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,

2017-09-24 10:36:02 788

原创 2017 ACM-ICPC 亚洲区（西安赛区）网络赛 - Coin（二项式展开）

Bob has a not even coin, every time he tosses the coin, the probability that the coin's front face up is qp(qp≤12)pq(pq≤21).The question is, when Bob tosses the coin kk times, what'

2017-09-23 18:16:06 404

原创 Codeforces Round #435 (Div. 2) - A B C

A. Mahmoud and Ehab and the MEX题意：MEX of the set就是求set里面没有的最小自然数。现在给你 n个数和目标mex。求出最少要改几次。POINT：数据很小，记录数有没有出现过，比x小且没有出现过久ans++。等于x且出现过就ans++。大于x不用考虑。#include #include #inclu

2017-09-20 17:27:30 459

原创 POJ 3694 Network(tarjan+lca)

NetworkTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 10463 Accepted: 3899DescriptionA network administrator manages a large network. The network consists of N computers and M links between...

2017-09-20 12:40:09 349

原创 UVA 796 - Critical Links （桥 tarjan）

In a computer network a link L, which interconnects two servers, is considered critical if there are atleast two servers A and B such that all network interconnection paths between A and B pass throug

2017-09-19 21:44:28 725 2

原创 UVA 315 - Network（割点 tarjan）

A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connectingseveral places numbered by integers from 1 toN. No two places have the same number. The linesare bidi

2017-09-19 21:31:24 815

原创 2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛 - J Our Journey of Dalian Ends(最小费用最大流)

Life is a journey, and the road we travel has twists and turns, which sometimes lead us to unexpected places and unexpected people.Now our journey of Dalian ends. To be carefully considered are the

2017-09-18 21:14:18 505

原创 Codeforces Round #434 (Div. 2) - A B C D

A. k-rounding:题意：给你一个n和一个k，让你求出最小的n的倍数，并且这个数有k个尾0。比如100有2个尾0。POINT：求n和1ek的公倍数。#include #include #include #include #include #include #include typedef long long LL;using namespace std;

2017-09-18 11:47:03 398

原创 2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛 - G Query on a string （KMP+树状数组）

You have two strings SS and TT in all capitals.Now an efficient program is required to maintain a operation and support a query.The operation C i chC i ch with given integer ii and capital l

2017-09-17 23:34:03 458

原创 2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛 - E Half-consecutive Numbers

The numbers 11, 33, 66, 1010, 1515, 2121, 2828, 3636, 4545 and ti=12i(i+1)ti=21i(i+1), are called half-consecutive.For given NN, find the smallest rr which is no smaller than NN such

2017-09-17 23:29:28 431

原创 HDU 4009 Transfer water（最小树形图）

Transfer waterTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 5373 Accepted Submission(s): 1947Problem DescriptionXiaoA lives

2017-09-15 18:56:41 259

原创 HDU 2121 Ice_cream’s world II(不定根最小树形图)

Ice_cream’s world IITime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5665 Accepted Submission(s): 1437Problem DescriptionAfter

2017-09-14 19:37:38 263

原创 POJ 3164 Command Network （最小树形图）

Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 18879 Accepted: 5434DescriptionAfter a long lasting war on words, a war on arms finall

2017-09-13 21:46:14 271

原创 UVA 11183 Teen Girl Squad（最小树形图）

You are part of a group ofn teenage girls armed with cellphones. You have some news you wantto tell everyone in the group. The problem is that no two of you are in the same room, and you mustcommu

2017-09-13 21:27:28 414

原创 HDU 4081 Qin Shi Huang's National Road System （次小生成树）

Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8709 Accepted Submission(s): 3084Problem Desc

2017-09-12 19:30:44 259

原创 HDU 1198 Farm Irrigation （BFS）

Farm IrrigationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10465 Accepted Submission(s): 4601Problem DescriptionBenny has

2017-09-12 00:29:11 334

原创 2017 ACM-ICPC 亚洲区（沈阳赛区）网络赛 - 02 04 05 08 12

1002 array array arrayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionOne day,

2017-09-10 19:26:47 727

原创 2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛 - A C F H

A: Bananatime limit200msmemory limit131072KBBananas are the favoured food of monkeys.In the forest, there is a Banana Company that provides bananas from different places.The company has

2017-09-10 18:22:50 1516

原创 POJ 1679 The Unique MST（次小生成树）

The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31994 Accepted: 11572DescriptionGiven a connected undirected graph, tell if its minimum sp

2017-09-08 17:48:47 237

原创 HDU 3605 Escape（多重匹配||状压缩点的网络流）

EscapeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 11151 Accepted Submission(s): 2676Problem Description2012 If this is th

2017-09-07 22:03:42 412

原创 HDU 4289 Control (拆点+网络流)

ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3618 Accepted Submission(s): 1522Problem Description　　You, the head of

2017-09-07 21:59:05 345

原创 POJ 2516 Minimum Cost （最小费用最大流）

Minimum CostTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 17300 Accepted: 6086DescriptionDearboy, a goods victualer, now comes to a big problem, and

2017-09-05 18:36:47 302

原创 HDU 4280 Island Transport （最大流）

Island TransportTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 9242 Accepted Submission(s): 2986Problem Description　　In th

2017-09-05 18:27:49 345

原创 POJ 2195 Going Home（最小费用最大流）

Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23546 Accepted: 11868DescriptionOn a grid map there are n little men and n houses. In each u

2017-09-04 20:39:13 352

原创 POJ 2449 Remmarguts' Date (A*+K短路)

Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 31149 Accepted: 8500Description"Good man never makes girls wait or breaks an appointme

2017-09-04 20:30:18 369

原创 Codeforces Round #431 (Div. 2) - B. Tell Your World

B. Tell Your Worldtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputConnect the countless points with lines,

2017-09-02 18:43:44 531

原创 Codeforces Round #431 (Div. 2) - A. Odds and Ends

A. Odds and Endstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhere do odds begin, and where do they end?

2017-09-02 18:40:19 314

空空如也

空空如也