junior19的博客

棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 40317 Accepted: 19685Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编

Bob is travelling in Xi’an. He finds many secret tunnels beneath the city. In his eyes, the city is a grid. He can’t enter a grid with a barrier. In one minute, he can move into an adjacent grid with ...

C. Square Subsetstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya was late for the lesson too. The te

D. A Simple Tasktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiven a simple graph, output the number of

题意：s个学科，每个学科至少要2个老师教，现有m个老师，不能辞退他们的前提下，从n个应聘者招收若干个使得每个学科至少2个老师教，求总工资的最小值。思路：dp[i][j]中的i表示科目被选的状态，j表示多于1个人选择某科目的状态，dp[(1# include # define INF 0x3f3f3f3fusing namespace std;int dp[1<<8][1<<8],

Little Zu Chongzhi's TrianglesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1811    Accepted Submission(s): 1016Problem Descript

Mondriaan's DreamTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 16037 Accepted: 9283DescriptionSquares and rectangles fascinated the famous Dutch pai

Hie with the PieTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7080 Accepted: 3806DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas t

炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 26747 Accepted: 10325Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），

Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14098 Accepted: 7396DescriptionFarmer John has purchased a lush new rectangular pasture com

reference：http://blog.csdn.net/stay_accept/article/details/51232891ContestTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1759    Accept

题意：有n台计算机，每台有n种服务。每台计算机有m个邻居，停止某台计算某个服务时，它邻居的相应服务也会停止，现在每台计算机可以选择停止其中一项服务，目标是让尽量多的服务停止（所有计算机都停止该服务）。·刘汝佳大白书# include # include using namespace std;int p[17], cover[1<<16], dp[1<<16];int main()

Problem DescriptionIn the mathematical discipline of graph theory, a matching in a graph is a set of edges without common vertices.You are given an undirected graph with n vertices, labeled by 1,2,...