09 2018 档案
摘要：Just A Mistake Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 168 Accepted Submission(s): 41 P
阅读全文
摘要：Intersection Time Limit: 4000/4000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 4238 Accepted Submission(s): 1623
阅读全文
摘要：Happy Matt Friends Time Limit: 6000/6000 MS (Java/Others) Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 5248 Accepted Submission(s):
阅读全文
摘要：Fluorescent Time Limit: 3000/3000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 937 Accepted Submission(s): 477 Pro
阅读全文
摘要：Dire Wolf Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3882 Accepted Submission(s): 2309 Pro
阅读全文
摘要：Black And White Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 5859 Accepted Submission(s): 16
阅读全文
摘要：A Curious Matt Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 3369 Accepted Submission(s): 18
阅读全文
摘要：一棵树上有n个节点，编号分别为1到n，每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成一些操作： I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点v的路径上的节点的最大权值 III. QSUM u v: 询问从点u到点v的路径上的节点的权
阅读全文
摘要：树链剖分就是将树分割成多条链，然后利用数据结构（线段树、树状数组等）来维护这些链。 首先就是一些必须知道的概念： 重结点：子树结点数目最多的结点； 轻节点：父亲节点中除了重结点以外的结点； 重边：父亲结点和重结点连成的边； 轻边：父亲节点和轻节点连成的边； 重链：由多条重边连接而成的路径； 轻链：由
阅读全文
摘要：Jessie and Justin want to participate in e-sports. E-sports contain many games, but they don't know which one to choose, so they use a way to make dec
阅读全文
摘要：There are NN different kinds of transport ships on the port. The i^{th}ith kind of ship can carry the weight of V[i]V[i] and the number of the i^{th}i
阅读全文
摘要：Problem Description I used to think I could be anything, but now I know that I couldn't do anything. So I started traveling.The nation looks like a co
阅读全文
摘要：After eating food from Chernobyl, DRD got a super power: he could clone himself right now! He used this power for several times. He found out that thi
阅读全文
摘要：God Water likes to eat meat, fish and chocolate very much, but unfortunately, the doctor tells him that some sequence of eating will make them poisono
阅读全文
摘要：Bob is a sorcerer. He lives in a cuboid room which has a length of AA, a width of BB and a height of CC, so we represent it as AA * BB * CC. One day,
阅读全文
摘要：Now you have a string consists of uppercase letters, two integers AA and BB. We call a substring wonderful substring when the times it appears in that
阅读全文
摘要：There are NN children in kindergarten. Miss Li bought them NN candies. To make the process more interesting, Miss Li comes up with the rule: All the c
阅读全文
摘要：A prince of the Science Continent was imprisoned in a castle because of his contempt for mathematics when he was young, and was entangled in some math
阅读全文
摘要：Jessie has a magic mirror. Every morning she will ask the mirror: 'Mirror mirror tell me, who is the most beautiful girl in the world?' If the mirror
阅读全文
摘要：Cable TV NETWORK The interconnection of the relays in a cable TV network is bi-directional. The network is connected if there is at least one intercon
阅读全文
摘要：最大权闭合子图 所谓闭合子图就是给定一个有向图，从中选择一些点组成一个点集V。对于V中任意一个点，其后续节点都仍然在V中。比如： 在这个图中有8个闭合子图：∅, {3}, {4}, {2,4}, {3,4}, {1,3,4}, {2,3,4}, {1,2,3,4} 最大权闭合子图即为：在一个图中权值
阅读全文
摘要：周末，小Hi和小Ho所在的班级决定举行一些班级建设活动。 根据周内的调查结果，小Hi和小Ho一共列出了N项不同的活动(编号1..N)，第i项活动能够产生a[i]的活跃值。 班级一共有M名学生(编号1..M)，邀请编号为i的同学来参加班级建设活动需要消耗b[i]的活跃值。 每项活动都需要某些学生在场才
阅读全文
摘要：Given a directed graph G, con- sider the following transformation. First, create a new graph T(G) to have the same vertex set as G. Cre- ate a directe
阅读全文
摘要：Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) orde
阅读全文
摘要：题目：http://acm.hdu.edu.cn/showproblem.php?pid=5934 There are NN bombs needing exploding. Each bomb has three attributes: exploding radius riri, positio
阅读全文
摘要：链接：https://codeforc.es/contest/1038 A题： 1 #include<bits/stdc++.h> 2 using namespace std; 3 typedef long long LL; 4 #define PI acos(-1.0) 5 typedef pai
阅读全文
