POJ1764.Dice Contest(矩阵快速幂)

最新推荐文章于 2020-07-23 19:07:23 发布

北路人

最新推荐文章于 2020-07-23 19:07:23 发布

阅读量488

点赞数 4

文章标签：矩阵快速幂

本文链接：https://blog.csdn.net/jokingcoder/article/details/88649328

版权

原题地址
蛮好的一道题目，但是一开始根本想不到这是矩阵快速幂

一开始最简单的想法就是dp，因为如果两个相差比较远的块中间是不可能走回头路的，只有可能是上下移动，所以就能使用dp来维护相邻两列之间的转移

我们用 $f [i] [j] [k]$ 表示在第 $i$ 列，第 $j$ 行，骰子状态为 $k$ 的最小代价
这里的状态存储方式需要使用得当一个有 $24$ 种状态
转移方程为 $f[i][j][k]=min_{jj\in[0,3]}(f[i-1][jj][change(k)])$

但是一看数据范围 $-10^9\leq x \leq 10^9$
啥玩意儿？？咕咕咕。。。

我们再返回去看这个状态方程… $m i n$ ???
~~然后突然灵光一闪~~
因为只要是满足结合律的运算都可以用矩阵快速幂来优化
而 $m i n$ 必然是满足结合律的，那么本题的基本思路就有了

~~（然而实现起来要有好多细节）~~

其中一个就是要特判初始方块和末方块在同一列的情况
直接spfa吧，因为不一定是直接在同一列上走的

还有一个坑点~~（可能是我程序的问题~~
刚开始读入了 $x 1, x 2, y 1, y 2$ ，结果CE？？
后来改成 $x a, x b, y a, y b$ 后就过了？？（一脸懵逼er

代码很长（表慌~

//Matrix Is Really a Mysterious Matter, So Enjoy It

#include <cstdio>
#include <algorithm>
#include <queue>
#define INF 0x3f3f3f3f3f3f3f3f
#define X 20
#define MN 10010

const int dd[6][6] = {
			{-1, 2, 4, 1, 3, -1}, {3, -1, 0, 5, -1, 2},
			{1, 5, -1, -1, 0, 4}, {4, 0, -1, -1, 5, 1},
			{2, -1, 5, 0, -1, 3}, {-1, 3, 1, 4, 2, -1}};
			
typedef long long LL;

int cnt, lst[MN], L[6], in[MN], xa, xb, ya, yb;
LL dis[MN], f[100], g[100][100];

struct Matrix {
	int N, M;
	LL S[96][96];
	inline Matrix(int n = 0, int m = 0, bool sn = 0) : N(n), M(m) {
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < m; ++j) {
				S[i][j] = INF;
			}
		}
		if (sn) for (int i = 0; i < n; ++i) S[i][i] = 0;
	}
	friend inline Matrix operator*(const Matrix &a, const Matrix &b) {
		Matrix c(a.N, b.M);
		for (int i = 0; i < c.N; ++i) {
			for (int j = 0 ; j < c.M; ++j) {
				for (int k = 0; k < a.M; ++k) {
					c.S[i][j] = std :: min(c.S[i][j], a.S[i][k] + b.S[k][j]);
				}
			}
		}
		return c;
	} 
};

struct Node{
	int to, nxt;
	LL len;
}e[MN << 1];

inline void add(int u, int v, int w) {
	e[++cnt].to = v;
	e[cnt].nxt = lst[u];
	e[cnt].len = w;
	lst[u] = cnt;
}

inline int getsta(int x, int y, int top, int front) {
	int now = -1;
	for (int i = 0; i < 6; ++i) {
		if (i != top && i != 5 - top) ++now;
		if (i == front) return x * 96 + y * 24 + top * 4 + now;
	}
	return -1;
}

inline void init() {
	for (int x = 0; x < X; ++x) {
		for (int y = 0; y < 4; ++y) {
			for (int top = 0; top < 6; ++top) {
				for (int front = 0; front < 6; ++front) {
					if (front == top || front == 5 - top) continue;
					int left = dd[top][front], u = getsta(x, y, top, front);
					int tt, v;
					if (x) {
						tt = 5 - left;
						v = getsta(x - 1, y, tt, front);
						add(u, v, L[tt]);
					}
					if (x + 1 < X) {
						tt = left;
						v = getsta(x + 1, y, tt, front);
						add(u, v, L[tt]);
					}
					if (y) {
						tt = 5 - front;
						v = getsta(x, y - 1, tt, top);
						add(u, v, L[tt]);
					}
					if (y < 3) {
						tt = front;
						v = getsta(x, y + 1, tt, 5 - top);
						add(u, v, L[tt]);
					}
				}
			}
		}
	}
}

inline void spfa(int sr) {
	std :: queue <int> team;
	for (int i = 0; i < X * 96; ++i) dis[i] = INF;
	dis[sr] = 0;
	in[sr] = 1;
	team.push(sr);
	while (!team.empty()) {
		int now = team.front();
		team.pop();
		for (int i = lst[now]; i; i = e[i].nxt) {
			if (dis[e[i].to] <= dis[now] + e[i].len) continue;
			dis[e[i].to] = dis[now] + e[i].len;
			if (!in[e[i].to]) team.push(e[i].to), in[e[i].to] = 1;
		}
		in[now] = 0;
	}
}

inline void rec(int x, LL A[]) {
	for (int y = 0; y < 4; ++y) {
		for (int top = 0; top < 6; ++top) {
			for (int front = 0; front < 6; ++front) {
				if (front == top || front == 5 - top) continue;
				int id = getsta(x, y, top, front);
				A[id % 96] = dis[id];
			}
		}
	}
}

inline Matrix ksm(Matrix a, int b) {
	Matrix ret(96, 96, 1);
	for (; b; b >>= 1, a = a * a) if (b & 1) ret = ret * a;
	return ret;
}

inline void doit() {
	int dif = std :: abs(xa - xb), x = X >> 1;
	LL ans = INF;
	spfa(getsta(x, ya, 0, 1));
	if (!dif) {
		for (int top = 0; top < 6; ++top) {
			for (int front = 0; front < 6; ++front) {
				if (front == top || front == 5 - top) continue;
				ans = std :: min(ans, dis[getsta(x, yb, top, front)]);
			}
		}
		printf("%lld\n", ans);
		return;
	}
	rec(x, f);
	for (int y = 0; y < 4; ++y) {
		for (int top = 0; top < 6; ++top) {
			for (int front = 0; front < 6; ++front) {
				if (front == top || front == 5 - top) continue;
				int sr = getsta(x, y, top, front);
				spfa(sr);
				rec(x + 1, g[sr % 96]);
			}
		}
	}
	Matrix A(96, 96);
	for (int i = 0; i < 96; ++i) {
		for (int j = 0; j < 96; ++j) {
			A.S[i][j] = g[i][j];
		}
	}
	A = ksm(A, dif);
	for (int i = 0; i < 96; ++i) {
		for (int j = 0; j < 96; ++j) {
			if (j / 24 == yb) ans = std :: min(ans, f[i] + A.S[i][j]);
		}
	}
	printf("%lld\n", ans);
	return;
}

int main() {
	int T;
	scanf("%d", &T);
	while (T--) {
		for (int i = 0; i < 6; ++i)
		scanf("%d", &L[i]);
		scanf("%d%d%d%d", &xa, &ya, &xb, &yb);
		--ya;
		--yb;
		if (xa > xb) std :: swap(L[2], L[3]);
		init();
		doit();
	}

	return 0;
}

//The Elder, The Myths of Time
//U{uJUjujuJjY[>vJjJjYv>[{jYuJuJJ<<[JJjY[<v[Y{ujJYu{vi>>v>vv[v[?[LjYJ{vi^>Y[<^>{JYJYj{JLJYuJJ{JYJ{YJu[ 
//J>[{v[v{?[><vUL<<?riYJ<^>[>v><<uj>r><^<uvi^?>v>v</>2j<r[LYLJ><r><?>^^qPviiuqUrr><>>v?[>v>[>[?v>??v>> 
//jLjJjYjYJL>/M&&/<iiN&&&vi<{L[i[&&Y/i/>&&&q^^[L{</u&&&&&GZZGqM&&u??i>&@&L>?&&@vJYujj[J{Y{Y{J{JYJLJLYv 
//{LYJ{jYJ[>M&@&&B&X&&@F&&M2L<u&B&&M&MP&&XZ&&qYL^>Z&&Y>&&j/^r<5&@2/<F&&&PEP&@&0OOMM@PvvYLYLYL{[{[{[YLL 
//Jvj{YLY{{^&@8&O&&&MEFUkO@@P/5&&M&Z&&BGqu1NB&B>E&&&&//Xkj&&@jSkNiY&&&&G''1&&<:/i::/>?{[{v{L{v{[{[{[Y> 
//{L{JYjLYvr&&@&MEGSuSkNFSFuiiU&&&&EZNuF5PkS5S^iu5j&&E51Yu&&@UJ2FEJS>B&Z,O&&BkZOE@&G^[v{v{v{vL[{[L[Yvv 
//J?JLYL{L{r?^Z&@G0&&O^r?@&O/r<<v&&EO0&&[//X&&r::'<&&>:iX&&@&&M>^<r:_M&&&&&&O./:_&&&^?LvLvLvLv[v{vLv[> 
//{vLYLL[L>1EN&&@&&&&@vYJ&&M/vNNG&&M&&&&v<<E&&5SqqG&&EN&&B@&Mq&&O2^/'@&&>_&&&XEEF&&&/?[[v[v[vLv[vLvLv? 
//{>L[{[Lv?Yk2J<^^YB&MXPN&&0r<22Ji:_^1&&&@&@&@BM@O@&&&&@8P&@&XZM&&MPjM&U''qBGJ12uZMPr>[?v?v>L?[?vvLvL> 
//[>[[?[[Lv?r<^<r</i/i/i/i/^<>/:"i[kXE080EPSFqZ00EqPSXFPFqPPXkSXq0qZOONSS2/_,:/i//:i<>>?>v>v>?>v>?>v>> 
//L<[>[>[>v>?>>>><><><><>r><<//YEM@BB8ZkqXkF0qqX11FS5U2FXkkSX5F5PXS50NSqBMBXY</i<<><>>><><><>>?>>>v>vr 
//v>?[>?>v>v>?>v>><><>>>>><r_r8@BMMMGZ00PEqZNP5q2UYjLL>[Ju{{[v>JjjjS00uJ1S10GO5r:ir<<><><><><><><>>?<< 
//vrv>>>>>><>>?>><><><><></:FB@GON0SNP0PP51uJLv?L<r//::_":::/_"_//i/<[L{FSk12UGOS</i<<><><><>r><>r<<>^ 
//<<>><><><><><><><><>r<i:/O&BGZNX11U5Y{L[<r^><^/i//::::_"__,___,_,",,:<<vuPP2jE@@<:i<r>r<r<r<^<r<r<<< 
//vi><><<<>r<r<<><><>r<i"i@&MO8NNFUL[v{>??[i<v[i/^i:/:/:/::_:::_:":_:__,::<LFFUuPB@r:i<r<^<^<^<^<r<r<^ 
//<r<<^<r<r<r<^<<<r<r<i_v&&MOOZZX5JL?jj{[>vv>[>i<>/::/_","_:"_.,,"_:_:_:"::^>uu1F0M@//iririr^r^<^<rrri 
//</<^<^<^<^r^r^r^<^r/:/&&B8O8OEN12[YU1jjL><>r?i>^i/i//_"_:,,' ''',,,,",:"::<>U5PNO&X_i/^i^/ri^i^i^ir/ 
//^/^<iririri^iriii^ii,X&MOO8OZZPSJ[uS2UYJ></ii<//:://:/":_:_",",,',,,',_/:::<[F08O&0_:i/i/i/i/ii^i^// 
//<:ri^i^i^/i/iii/i//:_M&MOOO8Z0quuuS51uJ>?<^///i::__,:_:::::::__,_,,',_::/"/<Yjq8M&u'//i/i///i///^ii: 
//^:ii/iii/i/i/i///i//.O&BOMOOG8F5SF51j2jvr>>>^/:/,.'',__,,/:"'' ''''_'_":::/>J1qOM&i,://i/i///i// 
//^:i///i/i:/:_:&&BOMOO0XFF221EEEXkS52FFk22{^'"i: ,:/://i/i/::^i/"_,/>>2OM&M._/:/:/:/:/:i: 
///::/:/:/:///:/::"'/MBBOMOMOGkS0ONS5UJ[ri:>{Sji  .P0uJUL[<</i<Y1FJi'/vPM&@['::::/:/:/:::/://: 
///_/:/:/:/:/:::/::::":',qZ0OOOE8MqN&EFS0q0qqNGPkF5i :&BPk&MNjju1jY><i_',_/8M{M@&@J __:"::::::/::::::_ 
///":::/:/::::":::":_:_':GF1SXSFU2u&SjEMF5FkU5kL<jZOJL&&&&@'>5k0ZMM0Pq5/'^Pj&&YEOS'',:":":":::::::"::_ 
//:,:::":::":":""_:_:""'_0quU2X1FuuMU<j[L<<<>i//i./1q@@i "&>'/L<:,' ''/5OMu'OE.'j[''__"_:_:_"_:_:_:_:, 
//:,::":":":_:_:______,,'2E1US1F55JXPY{r^<///><</:r8&@>.  ?&2./Lvv></:.<k, _Mv''?/'___,_,_,_,",","_"_, 
//:':_:_"____,_,",_,_,_.',E5XU51F25uP2UJJ></:__,/jBBNY/,'  /&F::/:/",'' :__Fu"/:i',,,,_,_,_,_,_,_,_,_' 
//_'_"__,_,_,,,_,,,_,_,_' JG55251S1FU5uuu2u5uuJ5G8jYUU/_' ' '15522ju[>r>YL>v"/:i''',',,,,,',',.,.,,_,' 
//_'_,,._,,,,.,,,.,',','' :0Su52F5FSS1jri:_,_'i5N5NM&BZF2>kMS:/?JuuLv>?r:'_/^,:"''.'.'.',',',.,',.,',' 
//,'.,.,',.,.,',',','.'.'' SZP252S5SFXkqU{?[?[LuuFXNqGEPJi^><^'  _/<//:/:ii^/"_,','.'''.'''.'''.',','' 
//_ ,'..,','.','''.'.'.'''  ,SX1F2FUFFXk2FkujJY>r/:"".' ''    .,_,/<UuY<>^iii,,''''''''''''''''''''''  
//'''.'''''''''''''''''''''  j0S1S5F5SU[/jqkkX2j><^^/,'''' ''.,//r^<^ri:_:/</, ''''''''''''''''''''''' 
//, .''''''''''''''''''''''' ^O5FSk5F51Yi,LZMOOOMMMOOZOZPqqPPS2>v{?//,""":^<' ''''' '''''''''''''''''  
//' ''''''''''''''''''''''''  kX2SSS1S5SL//uF2uFuUjYLJ?[Yv<[<i_''///::://^[" ' ''''''' ' ''''''' ' ''  
//' ''' ''''''''''''' ' '     >X1UFFS5PkSJ>:[JLLY[L^^r>/i/:.'',,"_//rir^LJ/     ' ' ' ' ' ' ' ' ' ' '  
//' '''' ''' ' ' ' '   '     /&0YSUkSkkqq05<:YuL<>>>r<r^//::":_:_,"r<??uY,                     '   '   
//' ' ' ' '                'N&&B{vXkSXqXNq8S[iL[>/:,:_,_, '''._',:<>?vL:                               
//                        u&&@M@@jiuP0PqPq0G0Puujjv</i:i/:,"_::/<uuuL<'                                
//'                'vFM&&&&BMOMOB&8i:L0EGN00GZG0NPNFUJuUFUujUjujjLY[:                                  
//             :jM&&&&&&&@MMOMOMOM@&5_'rjXZ8E8N0P0qZZGGOOO00SF2Ujj[/LEu{>^_                            
//         'LZ&&&@@MBMMOMOMOO8OOMOMM&@U,',i>US00ZXkFXSX21ujJjJUuJr' Z&&&&&&@&OS>_                      
//   ':vuZ&&&&MOZGZO8MOMOOOMOMOOOMOMM@&&>,,:_:/vuq0NSk2Y<ri^ir/,    Z&0E8OOMM@&&@&@8U^                 
//PZ&&&@&@BOOZ8E8E8G8ZOGOOOOOOOOMOMOMOB@&k/_/"_     .:>i"_"'        @MZqZEGZGG8GOOB@&&&@O2Y/           
//&@MMOO8OZGEG0ZE8ZGEGZ88MO8GOGO8MOO8O8MM&8: ''      _[XuX2jj/     '&ME00ZEZEZEZ08EZEG8M@&&&@&Zu/'     
//OZ8ZGZZZGEGZZEGEGZGE8ZOOOGOZ8G8GOZO8O8OO@M"     i8GOSj5LS150&0   '&M8N0NE0ENZEZEZEZEZEZ08GOM&&&&&ZJ' 
//ZZEZZGE8EGEGEGEGE8EGZ88MOO8OZOZOG8GOG8ZO8@@j  J&&&&MGXuj<uUB&&0   ZBZENZqZ0ZEZ0E0GEZ0Z0Z0Z0ZEGZOM&&& 
//808E8EGEGZGZ80GEZEGEZZOOM8OZO8O8OZOGO8OG8GM&G _Pqu0M@8PN[>8q/u8Z: S@80ZqZ0Z0ENG0G0GEZNZNZEZ0E0ENEE80 
//ZZE8ZGE8Z8ZGZG0GE8GGEZOMO8ZOZOZ8Z8Z8Z8ZZ0GEO&M  Jv'/jGMMP1Z     'iLBGZ0ZN0NE0EEZ0ZEZ0EqZ0ZEZ0ENZNE00 
//808Z8ZGE8E8ZGG8GGE8E8EMMME8ZGEZEGE8Z8EZ08EZZO&&  Y2''NGO8<Xi     "Y2M0GEZEE0ENZNE0ZNENZEG0Z0E0E0ENZq 
//ZZEZEGEGEZE8GOM@BMOO8OMBMMOMOM8OOMOO8O8O8O8O8M@&/ vEXMGNq5FO'     15OG080GEZEZNE0ENE0EEGEZ0ENZNE0EN0 
//8NGZ8EGZ8EGZOOFYk8&&&&BGOOMMBMB@&&&@&&&&&&&@&@&&&/.M&@&BM<>PM^   'uUMEZEG0ZEZ0Z0E0ZEZEZEG0ENZNE0E0Eq 
//88EGE8E8E8ZO&&Y:'''''/LOGOGGZM&L     ''' '      2&OM/''EOX5{u&k  S{LOO08Z8ZZEGE8Z88OG8Z8ZZ0ZNZ0ZNE00 
//MZOZZ0GZGZM8i/>LLv>,i'/B&&&MGM&M88MOB&   @BOMOOG@BB@   M&Eu8MLNZk&G[OO8O&&&G8ZM&&&&&&&&@OEE0E0Z0ZNEq 
//MMO8ZZE8GB@&uU1kN/  F&@&X  /MM25SXSqGM  >&GqkPSXUXM&   <.''_>OPuNi::8BMG":r@O@&S/...://_kONE0Z0ENEE0 
//8OBOOE8EM/  :r/,LP   FF   rZ&M_ ''''r     ','''''i&@'   <v'   JBY   @M&P   &&E   10/   X8ZZ0Z0ENZ0GN 
//008BMMGGONXM&?  YE     >&&@&B@@&&&&&&     G&&&@&&&M&   &&O&P   MJ  ,&B&M   &&G  .&&X  _&OZ0E0E0Z0000 
//MEZOBOOGM&&@_  S&5  E>  <M&&&B&&&&&>  <O  Z&&@&u[S&&   B&B8:  'Mu  '&&&S   @&&<  /^,>G&@OEZ0EEZEZNEN 
//MMGOMMOMM{   i@&&u  N&O/   '1&@Bu'   q&E  [BN8k   &&    ,_   /OqL'   "     &&B   Y>LYu28MOZ8ZGE0EE00 
//8GMOMMMO@U/j&@X '   8&&@&0>:qB<   LO&&&Mi '     :8@MX50NY[u^X8F[q&&J:[FB05kM&Y  2ZXPN   XMZEZ0Z0Z0Zq 
//E0EOOMOOO&&&MMOOO@&&M8Z8O@@&OOOB&&@&OGZM&&&&&&&&@by t123yh&&X^LjLM@&N&BB@&MO@?  /L{vi  [MOqEq0N0N0qN

北路人

关注

4
点赞
踩
0

收藏

觉得还不错? 一键收藏
3
评论
POJ1764.Dice Contest(矩阵快速幂)

原题地址蛮好的一道题目，但是一开始根本想不到这是矩阵快速幂一开始最简单的想法就是dp，因为如果两个相差比较远的块中间是不可能走回头路的，只有可能是上下移动，所以就能使用dp来维护相邻两列之间的转移我们用f[i][j][k]f[i][j][k]f[i][j][k]表示在第iii列，第jjj行，骰子状态为kkk的最小代价这里的状态存储方式需要使用得当一个有242424种状态转移方程为f[i]...
复制链接

扫一扫