persistent codeants

摘要： DescriptionAfter months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to spend all his money on them in a sneaker store.There are several brands of sneakers that Iserlohn wants to collect, such as Air Jordan and Nike Pro. And each bra 阅读全文

摘要： DescriptionAfter months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to spend all his money on them in a sneaker store.There are several brands of sneakers that Iserlohn wants to collect, such as Air Jordan and Nike Pro. And each bra 阅读全文

摘要： DescriptionThe cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 int dp[500010],i,j,k; 8 int n; 9 struct ds10 {11 int a,h,c;12 }e[500001];13 bool ... 阅读全文

摘要： Problem DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 int dfn[10011],low[10011],vec[100011],nxt[1110001],id[10011],sta[1000111],head[11001],vis[11001],num[11001],in[11001]; 8 int 阅读全文

摘要： Problem DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need to pay a $1 travel fee for every step he moves, until he enters a house. The task 阅读全文

摘要： Problem DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M supply places (marked from 1 to M), each provides K different kinds of goods (marked from 1 to K) 阅读全文

摘要： Problem DescriptionThe galaxy war between the Empire Draco and the Commonwealth of Zibu broke out 3 years ago. Draco established a line of defense called Grot. Grot is a straight line withNdefense stations. Because of the cooperation of the stations, Zibu’s Marine Glory cannot march any further but 阅读全文

摘要： Problem DescriptionYou are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn.Write a program that:reads the number of intervals, their end points and integers c1, ..., cn from the standard input,computes the minimal size of a set Z of integers which has at least ci common element 阅读全文

摘要： Problem DescriptionIn a modernized warehouse, robots are used to fetch the goods. Careful planning is needed to ensure that the robots reach their destinations without crashing into each other. Of course, all warehouses are rectangular, and all robots occupy a circular floor space with a diameter of 阅读全文

摘要： The cows have reconstructed Farmer John's farm, with its N barns (1 6 #include 7 #include 8 #include 9 #include10 using namespace std;11 #define INF 0x3f3f3f3f12 struct node13 {14 int v,next;15 }e[1001];16 int head[1001],I;17 int dp[181][181][181];18 int ch[1001],n,p,i;19 int a,b,res;20 int mi.. 阅读全文