1739

网上有一个《基于连通性状态压缩的动态规划问题》，基本是手把手教怎样使用状态压缩动态规划。。。。

 

#include <iostream>#include <iomanip>#include <algorithm>using namespace std;typedef char mtx[9][9];typedef int svct[9][9][900];typedef unsigned imap[900];template<typename T, int len>class curcular_queue{public:curcular_queue(): head(0), rear(0){}bool is_empty(){return head == rear;}bool is_full(){return (rear + 1) % len == head;}bool push_back(const T &x){if(!is_full()){data[rear] = x;rear = (rear + 1) % len;return true;}return false;}T pop_front(){if(!is_empty()){T x = data[head];head = (head + 1) % len;return x;}return T(0);}void clear(){head = rear = 0;}private:T data[len]; int head;int rear;};bool input(mtx &matrix, svct &sum, int n, int m);void build_index_map(imap &index_map, int len, int level, unsigned to, int left_minus_right, int &num);inline unsigned fetch(unsigned srt, int pos);inline unsigned set(unsigned srt, unsigned dest, int pos);int mate(unsigned srt, int pos);void f(mtx &matrix, int row, int col, int i, int j, unsigned p, unsigned right_p, unsigned up_p, int &offspring, unsigned (&x)[2]);int main(){int n, m;int _num = 0;mtx matrix;imap index_map;svct sum;int i, j;int last_i, last_j;int offspring;unsigned x[2], p;unsigned right_p, up_p;curcular_queue<unsigned, 1200> queue;build_index_map(index_map, 9, 0, 0, 0, _num);sort(index_map, index_map + _num);int last;int current;while(cin >> n >> m, m + n){queue.clear();if(!input(matrix, sum, n, m)){cout << 0 << endl;continue;}else if(1 == n && 1 == m){cout << 1 << endl;}if(1 == n){p = 0x30000011;}else if('#' == matrix[1][1]){p = 0x00000011;}else{p = 0x60000011;}sum[1][1][lower_bound(index_map, index_map + _num, p & 0xFFFFC000) - index_map] = 1;queue.push_back(p);while(!queue.is_empty()){p = queue.pop_front();last_i = (p & 0x000000F0) >> 4;last_j = p & 0x0000000F;p &= 0xFFFFC000;if(last_j != m){i = last_i;j = last_j + 1;}else{j = 1;i = last_i + 1;}right_p = fetch(p, j);up_p = fetch(p, j + 1);f(matrix, n, m, i, j, p, right_p, up_p, offspring, x);for(int k = 0; k < offspring; ++k){last = lower_bound(index_map, index_map + _num, p) - index_map;current = lower_bound(index_map, index_map + _num, x[k]) - index_map;if(!sum[i][j][current] && !(i == n && j == m)){queue.push_back(x[k] | (i << 4) | j);}//FILE *fp = fopen("G://1739.txt", "a+");//printf("(%d, %d)>>(%d, %d) %08X %08X ls: %03d lcs: %03d cs: %03d/n", last_i, last_j, i, j, p, x[k], sum[last_i][last_j][last], sum[i][j][current], sum[last_i][last_j][last] + sum[i][j][current]);//fclose(fp);sum[i][j][current] += sum[last_i][last_j][last];}}cout << sum[n][m][current] << endl;}return 0;}bool input(mtx &matrix, svct &sum, int n, int m){for(int i = 1; i <= n; ++i){for(int j = 1; j <= m; ++j){cin >> matrix[i][j];memset(sum[i][j], 0, 900 * sizeof(int));}}if('.' == matrix[n][1] && '.' == matrix[n][m]){return true;}return false;}void build_index_map(imap &index_map, int len, int level, unsigned to, int left_minus_right, int &num){if(len == level){index_map[num] = to;++num;}else if(len - level == left_minus_right){to |= 0x80000000 >> (level * 2);build_index_map(index_map, len, level + 1, to, left_minus_right - 1, num);}else{build_index_map(index_map, len, level + 1, to, left_minus_right, num);if(left_minus_right){unsigned temp = to | (0x80000000 >> (level * 2));build_index_map(index_map, len, level + 1, temp, left_minus_right - 1, num);}if(len - level >= 2 + left_minus_right){to |= 0x40000000 >> (level * 2);build_index_map(index_map, len, level + 1, to, left_minus_right + 1, num);}}}inline unsigned fetch(unsigned srt, int pos){return 0x00000003 & (srt >> (30 - (pos - 1) * 2));}inline unsigned set(unsigned srt, unsigned dest, int pos){return srt & ~(0xC0000000 >> (pos - 1) * 2) | dest << (30 - (pos - 1) * 2);}int mate(unsigned srt, int pos){int acc = 1;unsigned temp;switch(fetch(srt, pos)){case 1:while(acc){++pos;temp = fetch(srt, pos);if(1 == temp){++acc;}else if(2 == temp){--acc;}}return pos;case 2:while(acc){--pos;temp = fetch(srt, pos);if(2 == temp){++acc;}else if(1 == temp){--acc;}}return pos;default:cout << "werfghfgjk,hjmjgjfhjut78ui45y" << endl;return 0;}}void f(mtx &matrix, int row, int col, int i, int j, unsigned p, unsigned right_p, unsigned up_p, int &offspring, unsigned (&x)[2]){offspring = 0;if(!right_p && !up_p){if('#' == matrix[i][j]){offspring = 1;x[0] = set(p, 0, j);x[0] = set(x[0], 0, j + 1);if(j == col){x[0] >>= 2;}}else if(i == row && 1 == j || i != row && j != col){offspring = 1;x[0] = set(p, 1, j);x[0] = set(x[0], 2, j + 1);}}else if(1 == right_p && 1 == up_p){if('.' == matrix[i][j]){offspring = 1;x[0] = set(p, 1, mate(p, j + 1));x[0] = set(x[0], 0, j);x[0] = set(x[0], 0, j + 1);}}else if(2 == right_p && 2 == up_p && i != row){if('.' == matrix[i][j]){offspring = 1;x[0] = set(p, 2, mate(p, j));x[0] = set(x[0], 0, j);x[0] = set(x[0], 0, j + 1);if(j == col){x[0] >>= 2;}}}else if(2 == right_p && 1 == up_p && (i != row || i == row && 1 == mate(p, j))){if('.' == matrix[i][j]){offspring = 1;x[0] = set(p, 0, j);x[0] = set(x[0], 0, j + 1);}}else if(!right_p && up_p){if('.' == matrix[i][j]){if(i != row || i == row && ((j == col && 2 == up_p) || (1 == j && 1 == up_p))){offspring = 1;x[0] = set(p, up_p, j);x[0] = set(x[0], 0, j + 1);}if(j != col && (i != row || i == row && 1 != j)){x[offspring] = set(p, 0, j);x[offspring] = set(x[offspring], up_p, j + 1);++offspring;}else if(offspring && j == col){x[0] >>= 2;}}}else if(right_p && !up_p){if('.' == matrix[i][j]){if(i != row || i == row && j == col && 2 == right_p){offspring = 1;x[0] = set(p, right_p, j);x[0] = set(x[0], 0, j + 1);}if(j != col){x[offspring] = set(p, 0, j);x[offspring] = set(x[offspring], right_p, j + 1);++offspring;}else if(offspring){x[0] >>= 2;}}}}