Meek

摘要： D. Directed Roads D. Directed Roads ZS the Coder and Chris the Baboon has explored Udayland for quite some time. They realize that it consists of n to 阅读全文

摘要： C. Coloring Trees ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty an 阅读全文

摘要： 开关问题 Description 有N个相同的开关，每个开关都与某些开关有着联系，每当你打开或者关闭某个开关的时候，其他的与此开关相关联的开关也会相应地发生变化，即这些相联系的开关的状态如果原来为开就变为关，如果为关就变为开。你的目标是经过若干次开关操作后使得最后N个开关达到一个特定的状态。对于任意 阅读全文

摘要： D Tree Problem Description There is a skyscraping tree standing on the playground of Nanjing University of Science and Technology. On each branch of t 阅读全文

摘要： D. Happy Tree Party Bogdan has a birthday today and mom gave him a tree consisting of n vertecies. For every edge of the tree i, some number xi was wr 阅读全文

摘要： Problem 2082 过路费 Problem Description 有n座城市，由n-1条路相连通，使得任意两座城市之间可达。每条路有过路费，要交过路费才能通过。每条路的过路费经常会更新，现问你，当前情况下，从城市a到城市b最少要花多少过路费。 Input 有多组样例，每组样例第一行输入两个正 阅读全文

摘要： C. Subsequences For the given sequence with n different elements find the number of increasing subsequences with k + 1 elements. It is guaranteed that 阅读全文

摘要： Keep In Touch Problem Description There are n cities numbered with successive integers from 1 to n in Byteland. Also, there are m one-way roads connec 阅读全文

摘要： E. Minimum spanning tree for each edge E. Minimum spanning tree for each edge Connected undirected weighted graph without self-loops and multiple edge 阅读全文

摘要： D. Vika and Segments Vika has an infinite sheet of squared paper. Initially all squares are white. She introduced a two-dimensional coordinate system 阅读全文