2015年07月_broxin

原创 hdu2819 swap(二分图匹配)

DescriptionGiven an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all the diagonal entries equal to 1? InputT

2015-07-28 16:08:32 560

原创 hdu1813 Escape from Tetris (IDA*)

Problem Description由于整日整夜地对着这个棋盘，Lele终于走火入魔。每天一睡觉，他就会梦到自己会被人被扔进一个棋盘中，一直找不到出路，然后从梦中惊醒。久而久之，Lele被搞得精神衰弱。梦境是否会成为现实，谁也说不准，不过不怕一万只怕万一。现在Lele每次看到一个棋盘，都会想象一下自己被关进去以后要如何逃生。Lele碰到的棋盘都是正方形的，其中有些格子是坏的，不可

2015-07-28 15:50:11 547

原创 ZOJ1654 place the robots(二分图匹配)

Mem:32MB time:5sRobert is a famous engineer. One day he was given a task by his boss. The background of the task was the following:Given a map consisting of square blocks. There were three kin

2015-07-27 16:49:27 525

原创 [POJ3897] Maze Stretching (二分)(A*)

DescriptionUsually the path in a maze is calculated as the sum of steps taken from the starting point until the ending point, assuming that the distance of one step is exactly 1. Lets assume that

2015-07-23 21:22:46 467

原创 [POJ2449] Remmarguts' Date(裸k短路)(A*搜索)

Description"Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head, he told them a story. "Prince Remmarguts lives in

2015-07-23 18:43:40 593

原创 NOI2001方程的解数 (DFS技巧：meet in the middle)(非哈希)

题目：其中：x1, x2, …,xn是未知数，k1,k2,…,kn是系数，p1,p2,…pn是指数。且方程中的所有数均为整数。假设未知数1≤ xi ≤M, i=1,,,n，求这个方程的整数解的个数。输入第1行包含一个整数n。第2行包含一个整数M。第3行到第n+2行，每行包含两个整数，分别表示ki和pi。两个整数之间用一个空格隔开。第3行的数据对应i=1，第n

2015-07-20 21:54:24 2100

原创 NOI2015 day1 prog 程序自动分析（并查集）

程序自动分析【问题描述】在实现程序自动分析的过程中，常需要判定一些约束条件是否能被同时满足。考虑一个约束满足问题的简化版本：假设 x1,x2,x3,⋯ 代表程序中出现的变量，给定 n 个形如 xi=xj或 xi≠xj 的变量相等变量相等变量相等变量相等 /不等的约束条件，请判定是否可以分别为每一个变量赋予恰当的值，使得上述所有约束

2015-07-19 20:41:28 739

AZUI _ oi memories