贱人方

摘要： UOFTCG - Office Mates no tags no tags Dr. Baws has an interesting problem. His N Dr. Baws has an interesting problem. His N graduate students, while f 阅读全文

摘要： Gopu and the Grid Problem Gopu is interested in the integer co-ordinates of the X-Y plane (0<=x,y<=100000). Each integer coordinate contain a lamp, in 阅读全文

摘要： Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16967 Accepted: 7535 Description Cows are such finicky eaters. Each cow has a prefer 阅读全文

摘要： Tree Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 20816 Accepted: 6820 Description Give a tree with n vertices,each edge has a length(po 阅读全文

摘要： PT07J - Query on a tree III #tree #tree You are given a node-labeled rooted tree with n nodes. Define the query (x, k): Find the node whose label is k 阅读全文

摘要： 1468 : 2-SAT·hihoCoder新春晚会 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 hihoCoder新春晚会正在紧张地筹备中。晚会分为上半场和下半场，总导演小Hi现在要为N个节目安排演出时间(上半场或下半场)。为了描述方便，我们将第i个节目对应两个编 阅读全文

摘要： Phone List Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16341 Accepted: 5228 Description Given a list of phone numbers, determine if it 阅读全文

摘要： 统计难题 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 37626 Accepted Submission(s): 13858 Problem 阅读全文

摘要： The Company Dynamic Rankings has developed a new kind of computer that is no longer satisfied with the query like to simply find the k-th smallest num 阅读全文

摘要： COT - Count on a tree #tree #tree You are given a tree with N nodes.The tree nodes are numbered from 1 to N.Each node has an integer weight. We will a 阅读全文