結果

問題 No.2444 一次変換と体積
ユーザー sgfcsgfc
提出日時 2023-08-25 23:13:56
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,081 bytes
コンパイル時間 4,836 ms
コンパイル使用メモリ 322,652 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-06 18:03:02
合計ジャッジ時間 6,017 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

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

ソースコード

diff # 

#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>

#include <stdio.h>
#include <math.h>
#include <cassert>

#pragma warning(push)
#pragma warning(disable:26498 26450 26451 26812)
#include "atcoder/all"
#pragma warning(pop)

#include <float.h>


//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)

using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using pl = pair<ll, ll>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>;
using vvm = vector<vm>;

const char* YES = "Yes";
const char* NO = "No";
void yn(bool f) { std::cout << (f ? YES : NO) << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }
template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };

using mat_row = vector<modint>;
using mat = vector<mat_row>;
mat make_mat(ll size, modint init = 0) {
	return mat(size, mat_row(size, init));
}

vector<modint> operator*(const mat& a, const vector<modint>& b) {
	vector<modint> ret(a[0].size());
	for (size_t i = 0; i < a[0].size(); ++i) {
		for (size_t j = 0; j < a.size(); ++j) {
			ret[i] += a[i][j] * b[j];
		}
	}	
	return ret;
}

mat operator*(const mat& a, const mat& b) {
	mat c(a.size(), mat_row(b[0].size()));
	for (size_t i = 0; i < c.size(); ++i)
		for (size_t j = 0; j < c[0].size(); ++j)
			for (size_t k = 0; k < a[0].size(); ++k)
				c[i][j] += a[i][k] * b[k][j];
	return c;
}
mat pow(mat a, ll n) {
	mat res(a.size(), mat_row(a[0].size()));
	for (size_t i = 0; i < res.size(); ++i) res[i][i] = 1;
	for (; n; n /= 2) {
		if (n & 1) res = res * a;
		a = a * a;
	}
	return res;
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	ll n, b;
	cin >> n >> b;

	VLI(a1, 3);
	VLI(a2, 3);
	VLI(a3, 3);

	if (a1[0] == 0 && a1[1] == 0 && a1[2] == 0
		&& a2[0] == 0 && a2[1] == 0 && a2[2] == 0
		&& a3[0] == 0 && a3[1] == 0 && a3[2] == 0) {
		cout << "infty" << endl;
		return 0;
	}

	modint::set_mod(b);

	auto m = make_mat(3);
	REP(i, 3) {
		m[0][i] = a1[i];
		m[1][i] = a2[i];
		m[2][i] = a3[i];
	}

	m = pow(m, n);

	//rank
	mat_row m2(3);
	mat_row m3(3);
	mat_row m4(3);
	ll rk = 3;
	REP(i, 3) {
		if (m[0][0] != 0 && m[1][0] != 0) m2[i] = m[1][i] * m[0][0] - m[0][i] * m[1][0];
		else m2[i] = m[1][i] - m[0][i];
		if (m[0][0] != 0 && m[2][0] != 0) m3[i] = m[2][i] * m[0][0] - m[0][i] * m[2][0];
		else m3[i] = m[2][i] - m[0][i];
		if (m[1][0] != 0 && m[2][0] != 0) m4[i] = m[2][i] * m[1][0] - m[1][i] * m[2][0];
		else m4[i] = m[2][i] - m[1][i];
	}

	if (m2[0] == 0 && m2[1] == 0 && m2[2] == 0) {
		if (m3[0] == 0 && m3[1] == 0 && m3[2] == 0) {
			rk = 1;
		}
		else {
			rk = 2;
		}
	}
	else if (m3[0] == 0 && m3[1] == 0 && m3[2] == 0) {
		rk = 2;
	}
	else if (m4[0] == 0 && m4[1] == 0 && m4[2] == 0) {
		rk = 2;
	}

	if (rk == 3) {
		auto s = (m[0][1] * m[1][2] - m[0][2] * m[1][1]) * m[2][0]
			+ (m[0][2] * m[1][0] - m[0][0] * m[1][2]) * m[2][1]
			+ (m[0][0] * m[1][1] - m[0][1] * m[1][0]) * m[2][2];
		cout << s.inv().val() << endl;
	}
	else {
		cout << 0 << endl;
	}


}
0