ZOJ2317 Nice Patterns Strike Back

    By   watashi 。


import java.math.*;
import java.util.*;

public class Main {
	class Matrix implements Cloneable {
		public long[][] a;

		public Matrix() {
			a = new long[d][d];
		}

		public Matrix multiply(Matrix m) {
			Matrix ret = new Matrix();

			for (int i = 0; i < d; ++i) {
				for (int j = 0; j < d; ++j) {
					for (int k = 0; k < d; ++k) {
						ret.a[i][j] += a[i][k] * m.a[k][j];
					}
					ret.a[i][j] %= p;
				}
			}

			return ret;
		}

		public Matrix clone() {
			Matrix ret = new Matrix();

			ret.a = a.clone();

			return ret;
		}
	}

	private BigInteger n;
	private int m, d;
	private long p;

	public Main(BigInteger n, int m, long p) {
		this.n = n;
		this.m = m;
		this.d = 1 << m;
		this.p = p;
	}

	public long solve() {
		Matrix a = new Matrix();
		for (int i = 0; i < d; ++i) {
			for (int j = 0; j < d; ++j) {
				int x = i, y = j;
				for (int l = 1; l < m; ++l) {
					if ((x & 3) == (y & 3) && ((x & 3) == 0 || (y & 3) == 3)) {
						x = -1;
						break;
					} else {
						x >>= 1;
						y >>= 1;
					}
				}
				a.a[i][j] = (x == -1) ? 0 : 1;
			}
		}
		Matrix s = new Matrix();
		for (int i = 0; i < d; ++i) {
			s.a[i][i] = 1;
		}
		for (int i = n.bitLength() - 1; i >= 0; --i) {
			s = s.multiply(s);
			if (n.testBit(i)) {
				s = s.multiply(a);
			}
		}
		long ret = 0;
		for (int i = 0; i < d; ++i) {
			for (int j = 0; j < d; ++j) {
				ret += s.a[i][j];
			}
		}
		return ret % p;
	}

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int re = in.nextInt();
		for (int ri = 1; ri <= re; ++ri) {
			if (ri > 1) {
				System.out.println();
			}
			BigInteger n = in.nextBigInteger();
			int m = in.nextInt();
			int p = in.nextInt();
			Main solution = new Main(n.subtract(BigInteger.ONE), m, p);
			System.out.println(solution.solve());
		}
	}
}

//Run ID  	Submit Time  	Judge Status  	Problem ID  	Language  	Run Time(ms)  	Run Memory(KB)  	User Name
//1776580 	2009-03-03 19:19:21 	Accepted 	2317 	Java 	0 	2570 	watashi@Zodiac


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值