状压dp
junior19
abcde
展开
-
POJ1321:棋盘问题(状压dp & DFS)
棋盘问题 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 40317 Accepted: 19685 Description 在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编原创 2017-02-08 21:50:12 · 287 阅读 · 0 评论 -
HDU4856:Tunnels (BFS & 状压dp)
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 ...原创 2018-04-02 21:36:13 · 406 阅读 · 0 评论 -
CF895C:C. Square Subsets(状压dp)
C. Square Subsets time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Petya was late for the lesson too. The te原创 2017-11-27 19:26:40 · 436 阅读 · 0 评论 -
CF11D:A Simple Task(状压dp & 图)
D. A Simple Task time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Given a simple graph, output the number of原创 2017-07-31 15:25:56 · 674 阅读 · 0 评论 -
UVA10817:Headmaster's Headache(状压dp)
题意:s个学科,每个学科至少要2个老师教,现有m个老师,不能辞退他们的前提下,从n个应聘者招收若干个使得每个学科至少2个老师教,求总工资的最小值。 思路:dp[i][j]中的i表示科目被选的状态,j表示多于1个人选择某科目的状态,dp[(1 # include # define INF 0x3f3f3f3f using namespace std; int dp[1<<8][1<<8],原创 2017-03-23 00:03:42 · 256 阅读 · 0 评论 -
HDU5135:Little Zu Chongzhi's Triangles(状压dp)
Little Zu Chongzhi's Triangles Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 1811 Accepted Submission(s): 1016 Problem Descript原创 2017-02-21 20:56:20 · 203 阅读 · 0 评论 -
POJ2411:Mondriaan's Dream(状压dp)
Mondriaan's Dream Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 16037 Accepted: 9283 Description Squares and rectangles fascinated the famous Dutch pai原创 2017-02-19 20:23:29 · 246 阅读 · 0 评论 -
POJ3311:Hie with the Pie(状压dp + FLOYD最短路)
Hie with the Pie Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 7080 Accepted: 3806 Description The Pizazz Pizzeria prides itself in delivering pizzas t原创 2017-02-09 13:58:06 · 309 阅读 · 0 评论 -
POJ1185:炮兵阵地(状压dp)
炮兵阵地 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 26747 Accepted: 10325 Description 司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),原创 2017-01-30 14:40:15 · 257 阅读 · 0 评论 -
POJ3254:Corn Fields(状压dp入门)
Corn Fields Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 14098 Accepted: 7396 Description Farmer John has purchased a lush new rectangular pasture com原创 2017-01-30 10:52:38 · 289 阅读 · 0 评论 -
HDU5045:Contest(状压dp)
reference:http://blog.csdn.net/stay_accept/article/details/51232891 Contest Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1759 Accept原创 2017-02-09 20:02:52 · 202 阅读 · 0 评论 -
UVA11825: Hackers' Crackdown (状压dp)
题意:有n台计算机,每台有n种服务。每台计算机有m个邻居,停止某台计算某个服务时,它邻居的相应服务也会停止,现在每台计算机可以选择停止其中一项服务,目标是让尽量多的服务停止(所有计算机都停止该服务)。 ·刘汝佳大白书 # include # include using namespace std; int p[17], cover[1<<16], dp[1<<16]; int main()原创 2017-02-09 17:06:15 · 215 阅读 · 0 评论 -
HDU6321:Problem C. Dynamic Graph Matching(状压dp)
Problem Description In 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,...原创 2018-07-31 00:07:04 · 854 阅读 · 0 评论