WhaleFall

Meteor ShowerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19078 Accepted: 4951DescriptionBessie hears that an extraordinary meteor shower is coming;

Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 31470 Accepted: 8580Description"Good man never makes girls wait or breaks an appointment

Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19564 Accepted: 7705DescriptionA number of schools are connected to a computer network

E. Kidnappingtime limit per test1.0 smemory limit per test256 MBinputinput.txtoutputoutput.txtBerland's Police has a serious problem. A foreign ambassador arriv

G. It is all about wisdomtime limit per test11.0 smemory limit per test1024 MBinputstandard inputoutputstandard outputFoki is the president of the Martian Unite

E. The Road to Berland is Paved With Good Intentionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland

D - Score AttackTime limit : 2sec / Memory limit : 256MBScore : 400 pointsProblem StatementThere is a directed graph with N vertices and M edges. The i-th edge (1≤i≤M) points

C - Nuske vs Phantom ThnookTime limit : 4sec / Memory limit : 256MBScore : 700 pointsProblem StatementNuske has a grid with N rows and M columns of squares. The rows are numbered 1

NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13771 Accepted: 6257DescriptionA Telephone Line Company (TLC) is establishing a new telephone cab

Triplet Min SumTime limit: 2500 msMemory limit: 128 MBYou are given a tree with NN nodes. Answer QQ queries of the type:Given three distinct nodes AA, BB, and CC, find the

Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 33426 Accepted: 13615DescriptionEvery cow's dream is to become the most popular cow in the h

章鱼哥没有女朋友Time limit per test: 1.0 secondsTime limit all tests: 1.0 secondsMemory limit: 256 megabytes章鱼哥要送给他的女朋友一条项链，但他长期打 ACM 已经分辨不出什么是项链了，所以想请你帮帮他。在章鱼哥眼中，他所买的东西就是个 n 个点和 m 条边构成的

题目大意:寻找luckynumber，她的定义是从n和m中各挑选一个六位数，使之n中的前三位之和与m中的后三位之和相同或者n中的后三位之和与m中的前三位之和相同，已经被选中的无法再组合，要是上面两种情况同时符合，选择和最大的一组，要是前者符合条件，在输出的时候输出AT和选中的两个六位数，否则是TA选中的两个六位数，排在前面的优先输出，然后按照第一个六位数的降序排列解题思路:这是一道二分图的题，

Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 52332 Accepted: 17678DescriptionBessie is out in the field and wants to get back t

Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 78164 Accepted: 30497DescriptionEvery time it rains on Farmer John's fields, a pond form