plysc

摘要： Description Being a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights 阅读全文

摘要： 题目描述 在一个 n*n个方格的国际象棋棋盘上，马（骑士）可以攻击的棋盘方格如图所示。棋盘上某些方格设置了障碍，骑士不得进入 对于给定的 n*n 个方格的国际象棋棋盘和障碍标志，计算棋盘上最多可以放置多少个骑士，使得它们彼此互不攻击 在一个 n*n个方格的国际象棋棋盘上，马（骑士）可以攻击的棋盘方格 阅读全文

摘要： Muddy Fields Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13386 Accepted: 4923 Description Rain has pummeled the cows' field, a rectangu 阅读全文

摘要： 二分图匹配，将各个时刻的门与人相连，跑个二分图就行了 Evacuation Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4753 Accepted: 1238 Description Fires can be disastro 阅读全文

摘要： Description Byteotia城市有n个 towns m条双向roads. 每条 road 连接 两个不同的 towns ,没有重复的road. 所有towns连通。 Byteotia城市有n个 towns m条双向roads. 每条 road 连接 两个不同的 towns ,没有重复的r 阅读全文

摘要： It's almost summer time, and that means that it's almost summer construction time! This year, the good people who are in charge of the roads on the tr 阅读全文

摘要： Description David the Great has just become the king of a desert country. To win the respect of his people, he decided to build channels all over his 阅读全文

摘要： 题目描述 给定一棵N个节点的树，每个点有一个权值，对于M个询问(u,v,k)，你需要回答u xor lastans和v这两个节点间第K小的点权。其中lastans是上一个询问的答案，初始为0，即第一个询问的u是明文。 给定一棵N个节点的树，每个点有一个权值，对于M个询问(u,v,k)，你需要回答u 阅读全文

摘要： Description 某天，wangxz神犇来到了一个信息学在线评测系统(Online Judge)。由于他是一位哲♂学的神犇，所以他不打算做题。他发现这些题 目呈线性排列，被标记为1~n号，每道题都有一个难度值(可以<=0)。他决定与这些题目玩♂耍。 1、他可以在某个位置插♂入一些难度值特定的题 阅读全文

摘要： Description Bessie was poking around the ant hill one day watching the ants march to and fro while gathering food. She realized that many of the ants 阅读全文