随笔分类 - ACM-BFS
摘要：Description 轮状病毒有很多变种，所有轮状病毒的变种都是从一个轮状基产生的。一个N轮状基由圆环上N个不同的基原子和圆心处一个核原子构成的，2个原子之间的边表示这2个原子之间的信息通道。如下图所示 N轮状病毒的产生规律是在一个N轮状基中删去若干条边，使得各原子之间有唯一的信息通道，例如共有1
阅读全文
摘要：The ant Welly now dedicates himself to urban infrastructure. He came to the kingdom of numbers and solicited an audience with the king. He recounted h
阅读全文
摘要：Black And White Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 5859 Accepted Submission(s): 16
阅读全文
摘要：There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two
阅读全文
摘要：题目链接： https://odzkskevi.qnssl.com/0c87453efec2747f8e8a573525fd42f9?v=1533651456 题解： 这是一道Trie+BFS的题目； 这是第二次写了 Orz 还是WA好几发； 这一题，我们可以用字典树存已有的单词，在存的时候，记录一
阅读全文
摘要：New labyrinth attraction is open in New Lostland amusement park. The labyrinth consists of n rooms connected by m passages. Each passage is colored in
阅读全文
摘要：Ignatius再次被魔王抓走了(搞不懂他咋这么讨魔王喜欢)…… 这次魔王汲取了上次的教训，把Ignatius关在一个n*m的地牢里，并在地牢的某些地方安装了带锁的门，钥匙藏在地牢另外的某些地方。刚开始Ignatius被关在(sx,sy)的位置，离开地牢的门在(ex,ey)的位置。Ignatius每
阅读全文
摘要：The Czech Technical University is rather old — you already know that it celebrates 300 years of its existence in 2007. Some of the university building
阅读全文
摘要：At Valentine's eve, Shylock and Lucar were enjoying their time as any other couples. Suddenly, LSH, Boss of FFF Group caught both of t...
阅读全文
摘要：Barareh on Fire Submit Page Summary Time Limit: 3 Sec Memory Limit: 512 Mb Submitted: 102 Solved: 48 Description The Barareh village is on fire due to
阅读全文
摘要：The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room
阅读全文
摘要：Background Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another s...
阅读全文
摘要：The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of
阅读全文
摘要：There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. F...
阅读全文
摘要：度度熊是一个喜欢计算机的孩子，在计算机的世界中，所有事物实际上都只由0和1组成。 现在给你一个n*m的图像，你需要分辨他究竟是0，还是1，或者两者均不是。 图像0的定义：存在1字符且1字符只能是由一个连通块组成，存在且仅存在一个由0字符组成的连通块完全被1所包围。 图...
阅读全文
摘要：You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', imp
阅读全文
摘要：You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock.
阅读全文
