题目链接: http://codeforces.com/contest/592/problem/D 题意: 给你一颗树,树上有一些必须访问的节点,你可以任选一个起点,依次访问所有的必须访问的节点,使总路程最短. 题解: 由于是树,任意两点间路径唯一,是确定的. 首先我们要先建一颗树:包括所有必须访问的节点,已经它们之间的路径. 我们选的起点一定是某个必须访问的节点,如果我们把所有的必须访问的节点访问一遍并且回到起点,那么我们用的最小花费就是边数*2(这个可以用反证法证明),所以只要我们找出新树的…

D. Super M Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/592/problem/D Description Ari the monster is not an ordinary monster. She is the hidden identity of Super M, the Byteforces’ superhero. Byteforces is a country that…

C. The Big Race Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/592/problem/C Description Vector Willman and Array Bolt are the two most famous athletes of Byteforces. They are going to compete in a race with a distance of…

B. The Monster and the Squirrel Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/592/problem/B Description Ari the monster always wakes up very early with the first ray of the sun and the first thing she does is feeding her…

A. PawnChess Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/592/problem/A Description Galois is one of the strongest chess players of Byteforces. He has even invented a new variant of chess, which he named «PawnChess». Thi…

这场CF,准备充足,回寝室洗了澡,睡了一觉,可结果...   水 A - PawnChess 第一次忘记判断相等时A先走算A赢,hack掉.后来才知道自己的代码写错了(摔 for (int i=1; i<=8; ++i) { scanf ("%s", s[i]); //!!! } 数学(找规律) B - The Monster and the Squirrel 题意:多边形每个顶点向其它的点引射线,如果碰到其他射线则停止,问最后多边形被分成多少个区域 分析:搬题解: Proble…

B. The Monster and the Squirrel time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Ari the monster always wakes up very early with the first ray of the sun and the first thing she does is feed…

A. PawnChess time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Galois is one of the strongest chess players of Byteforces. He has even invented a new variant of chess, which he named «PawnChe…

A. PawnChess time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Galois is one of the strongest chess players of Byteforces. He has even invented a new variant of chess, which he named «PawnChe…

C. The Big Race time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vector Willman and Array Bolt are the two most famous athletes of Byteforces. They are going to compete in a race with a dist…