結果

問題 No.526 フィボナッチ数列の第N項をMで割った余りを求める
ユーザー 20136122013612
提出日時 2022-05-28 20:11:33
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,080 bytes
コンパイル時間 1,703 ms
コンパイル使用メモリ 106,228 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-20 23:38:17
合計ジャッジ時間 2,479 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,944 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 WA -
testcase_12 AC 2 ms
6,940 KB
testcase_13 WA -
testcase_14 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<vector>
using namespace std;

int n, m;
long long ans;
vector<vector<long long>> a = {{1, 1}, {1, 0}}, b = {{1, 0}};

struct matrix{
	int row, col;
	long long size;
	vector<vector<long long>> val;
	
	matrix(int x, int y) {
		row = x;
		col = y;
		size = 1;
		while (size < max(row, col)) {
			size *= 2;
		}
		vector<vector<long long>> temp(size, vector<long long>(size, 0));
		val = temp;
	}
	
	matrix(vector<vector<long long>> z) {
		row = z.size();
		for (auto x : z) {
			col = max(col, (int) x.size());
		}
		size = 1;
		while (size < max(row, col)) {
			size *= 2;
		}
		for (int i = 0; i < size; i++) {
			vector<long long> temp = vector<long long>(size, 0);
			if (i < z.size()) {
				z[i].resize(size, 0);
				temp = z[i];
			}
			val.push_back(temp);
		}
	}
	
	matrix operator + (matrix const &obj) {
		matrix temp(row, col);
		if (row == obj.row && col == obj.col) {
			for (int i = 0; i < row; i++) {
				for (int j = 0; j < col; j++) {
					temp.val[i][j] = val[i][j] + obj.val[i][j];
				}
			}
		} else {
			cout << "wrong size!" << endl;
		}
		return temp;
	}
	
	matrix operator - (matrix const &obj) {
		matrix temp(row, col);
		if (row == obj.row && col == obj.col) {
			for (int i = 0; i < row; i++) {
				for (int j = 0; j < col; j++) {
					temp.val[i][j] = val[i][j] - obj.val[i][j];
				}
			}
		} else {
			cout << "wrong size!" << endl;
		}
		return temp;
	}
	
	void print() {
		cout << row << " " << col << endl;
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < col; j++) {
				cout << val[i][j] << " "; 
			}
			cout << endl;
		}
	}
} ma(a), mb(b);

matrix obtain(matrix a, int p, int q, int r, int s) {
	matrix temp(r, s);
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < s; j++) {
			temp.val[i][j] = a.val[p + i][q + j];
		}
	}
	return temp;
}

matrix combine(matrix a, matrix b, matrix c, matrix d) {
	int row = a.row + c.row;
	int col = a.col + b.col;
	matrix temp(row, col);
	for (int i = 0; i < a.row; i++) {
		for (int j = 0; j < a.col; j++) {
			temp.val[i][j] = a.val[i][j];
		}
	}
	for (int i = 0; i < b.row; i++) {
		for (int j = 0; j < b.col; j++) {
			temp.val[i][a.col + j] = b.val[i][j];
		}
	}
	for (int i = 0; i < c.row; i++) {
		for (int j = 0; j < c.col; j++) {
			temp.val[a.row + i][j] = c.val[i][j];
		}
	}
	for (int i = 0; i < d.row; i++) {
		for (int j = 0; j < d.col; j++) {
			temp.val[a.row + i][a.col + j] = d.val[i][j];
		}
	}
	return temp;
}

matrix sum(matrix a, matrix b, int p1, int q1, int p2, int q2, int r, int s, int sign) {
	matrix temp(r, s);
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < s; j++) {
			temp.val[i][j] = a.val[p1 + i][q1 + j] + sign * b.val[p2 + i][q2 + j];
		}
	}
	return temp;
}

matrix mul(matrix a, matrix b) {
	int r = a.row;
	int c = a.col;
	int size = a.size;
	matrix temp(r, c);
	if (temp.size == 1) {
		temp.val[0][0] = a.val[0][0] * b.val[0][0] % m;
		return temp;
	}
	matrix a11 = obtain(a, 0, 0, size/2, size/2);
	matrix a12 = obtain(a, 0, size/2, size/2, size/2);
	matrix a21 = obtain(a, size/2, 0, size/2, size/2);
	matrix a22 = obtain(a, size/2, size/2, size/2, size/2);
	matrix b11 = obtain(b, 0, 0, size/2, size/2);
	matrix b12 = obtain(b, 0, size/2, size/2, size/2);
	matrix b21 = obtain(b, size/2, 0, size/2, size/2);
	matrix b22 = obtain(b, size/2, size/2, size/2, size/2);
	matrix fxxk1 = mul(a11, b12 - b22);
	matrix fxxk2 = mul(a11 + a12, b22);
	matrix fxxk3 = mul(a21 + a22, b11);
	matrix fxxk4 = mul(a22, b21 - b11);
	matrix fxxk5 = mul(a11 + a22, b11 + b22);
	matrix fxxk6 = mul(a12 - a22, b21 + b22);
	matrix fxxk7 = mul(a11 - a21, b11 + b12);
	temp = combine(fxxk5 + fxxk4 - fxxk2 + fxxk6, fxxk1 + fxxk2, fxxk3 + fxxk4, fxxk1 + fxxk5 - fxxk3 - fxxk7);
	temp.row = a.row;
	temp.col = a.col;
	return temp;
}

matrix pow(matrix a, int b) {
	if (b == 1) {
		return a;
	}
	if (b & 1) {
		return mul(a, pow(a, b - 1));
	} else {
		matrix temp = pow(a, b / 2);
		return mul(temp, temp);
	}
}

int main() {
	scanf("%d %d", &n, &m);
	matrix t = pow(ma, n - 2);
	t = mul(t, mb);
	printf("%lld\n", (t.val[0][0] + m) % m);
	return 0;
}
0