#495537 (C++17) No.579 3 x N グリッド上のサイクルのサイズ(hard)

提出ソース

結果

問題	No.579 3 x N グリッド上のサイクルのサイズ(hard)
ユーザー	FF256grhy
提出日時	2020-06-12 20:52:04
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	8 ms / 2,000 ms
コード長	5,913 bytes
コンパイル時間	2,259 ms
コンパイル使用メモリ	212,572 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-06-24 04:11:40
合計ジャッジ時間	4,670 ms
ジャッジサーバーID （参考情報）	judge5 / 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	3 ms 6,944 KB
testcase_05	AC	3 ms 6,940 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	2 ms 6,944 KB
testcase_17	AC	3 ms 6,944 KB
testcase_18	AC	2 ms 6,940 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	3 ms 6,944 KB
testcase_21	AC	3 ms 6,944 KB
testcase_22	AC	3 ms 6,944 KB
testcase_23	AC	3 ms 6,940 KB
testcase_24	AC	3 ms 6,940 KB
testcase_25	AC	3 ms 6,944 KB
testcase_26	AC	3 ms 6,940 KB
testcase_27	AC	3 ms 6,944 KB
testcase_28	AC	3 ms 6,944 KB
testcase_29	AC	3 ms 6,940 KB
testcase_30	AC	3 ms 6,940 KB
testcase_31	AC	3 ms 6,940 KB
testcase_32	AC	3 ms 6,944 KB
testcase_33	AC	3 ms 6,940 KB
testcase_34	AC	3 ms 6,944 KB
testcase_35	AC	3 ms 6,940 KB
testcase_36	AC	3 ms 6,940 KB
testcase_37	AC	3 ms 6,944 KB
testcase_38	AC	3 ms 6,944 KB
testcase_39	AC	3 ms 6,940 KB
testcase_40	AC	4 ms 6,944 KB
testcase_41	AC	4 ms 6,944 KB
testcase_42	AC	4 ms 6,944 KB
testcase_43	AC	4 ms 6,944 KB
testcase_44	AC	5 ms 6,944 KB
testcase_45	AC	4 ms 6,944 KB
testcase_46	AC	4 ms 6,944 KB
testcase_47	AC	5 ms 6,940 KB
testcase_48	AC	4 ms 6,940 KB
testcase_49	AC	4 ms 6,940 KB
testcase_50	AC	4 ms 6,940 KB
testcase_51	AC	4 ms 6,944 KB
testcase_52	AC	4 ms 6,940 KB
testcase_53	AC	4 ms 6,940 KB
testcase_54	AC	4 ms 6,948 KB
testcase_55	AC	4 ms 6,944 KB
testcase_56	AC	4 ms 6,948 KB
testcase_57	AC	5 ms 6,940 KB
testcase_58	AC	4 ms 6,940 KB
testcase_59	AC	4 ms 6,940 KB
testcase_60	AC	7 ms 6,940 KB
testcase_61	AC	7 ms 6,944 KB
testcase_62	AC	8 ms 6,940 KB
testcase_63	AC	7 ms 6,940 KB
testcase_64	AC	7 ms 6,940 KB
testcase_65	AC	8 ms 6,944 KB
testcase_66	AC	7 ms 6,940 KB
testcase_67	AC	7 ms 6,944 KB
testcase_68	AC	7 ms 6,944 KB
testcase_69	AC	7 ms 6,940 KB
testcase_70	AC	7 ms 6,944 KB
testcase_71	AC	7 ms 6,944 KB
testcase_72	AC	7 ms 6,944 KB
testcase_73	AC	8 ms 6,940 KB
testcase_74	AC	7 ms 6,944 KB
testcase_75	AC	7 ms 6,944 KB
testcase_76	AC	7 ms 6,940 KB
testcase_77	AC	7 ms 6,940 KB
testcase_78	AC	7 ms 6,940 KB
testcase_79	AC	7 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define dec(i, n)  decID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define SI(v) static_cast<int>(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
#define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__);
void IN_() { };
template<typename T, typename ... U> void IN_(T &  a, U &  ... b) { cin >> a; IN_(b ...); };
template<typename T                > void OUT(T && a            ) { cout << a << endl; }
template<typename T, typename ... U> void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); }

// ---- ----

template<typename T, int N> struct Matrix {
	vector<vector<T>> v;
	Matrix(T t) {
		init();
		inc(i, N) { v[i][i] = t; }
	}
	Matrix(vector<vector<T>> const & w = { }) { init(w); }
	void init(vector<vector<T>> const & w = { }) {
		v = vector<vector<T>>(N, vector<T>(N, 0));
		assert(w.size() <= N);
		inc(i, w.size()) { assert(w[i].size() <= N);
		inc(j, w[i].size()) {
			v[i][j] = w[i][j];
		}
		}
	}
	vector<T> const & operator[](int i) const { return v[i]; }
	vector<T>       & operator[](int i)       { return v[i]; }
	friend Matrix operator+(Matrix const & a, Matrix const & b) {
		Matrix c;
		inc(i, N) {
		inc(j, N) {
			c[i][j] = a[i][j] + b[i][j];
		}
		}
		return c;
	}
	friend Matrix operator-(Matrix const & a, Matrix const & b) {
		Matrix c;
		inc(i, N) {
		inc(j, N) {
			c[i][j] = a[i][j] - b[i][j];
		}
		}
		return c;
	}
	friend Matrix operator*(Matrix const & a, Matrix const & b) {
		Matrix c;
		inc(i, N) {
		inc(j, N) {
		inc(k, N) {
			c[i][j] += a[i][k] * b[k][j];
		}
		}
		}
		return c;
	}
	friend Matrix operator^(Matrix const & a, LL b) {
		Matrix c(1), e = a; assert(b >= 0);
		while(b) { if(b & 1) { c *= e; } e *= e; b >>= 1; }
		return c;
	}
	friend Matrix & operator+=(Matrix & a, Matrix const & b) { return (a = a + b); }
	friend Matrix & operator-=(Matrix & a, Matrix const & b) { return (a = a - b); }
	friend Matrix & operator*=(Matrix & a, Matrix const & b) { return (a = a * b); }
	friend Matrix & operator^=(Matrix & a, LL             b) { return (a = a ^ b); }
	friend ostream & operator<<(ostream & os, Matrix const & m) {
		inc(i, N) {
		inc(j, N) {
			os << m[i][j] << " ";
		} os << endl;
		} return os;
	}
};

// ----

template<LL M> class ModInt {
private:
	LL v;
	pair<LL, LL> ext_gcd(LL a, LL b) {
		if(b == 0) { assert(a == 1); return { 1, 0 }; }
		auto p = ext_gcd(b, a % b);
		return { p.SE, p.FI - (a / b) * p.SE };
	}
public:
	ModInt(LL vv = 0) { v = vv; if(abs(v) >= M) { v %= M; } if(v < 0) { v += M; } }
	LL get_v() { return v; }
	ModInt inv() { return ext_gcd(M, v).SE; }
	ModInt exp(LL b) {
		ModInt p = 1, a = v; if(b < 0) { a = a.inv(); b = -b; }
		while(b) { if(b & 1) { p *= a; } a *= a; b >>= 1; }
		return p;
	}
	friend bool      operator< (ModInt    a, ModInt   b) { return (a.v <  b.v); }
	friend bool      operator> (ModInt    a, ModInt   b) { return (a.v >  b.v); }
	friend bool      operator<=(ModInt    a, ModInt   b) { return (a.v <= b.v); }
	friend bool      operator>=(ModInt    a, ModInt   b) { return (a.v >= b.v); }
	friend bool      operator==(ModInt    a, ModInt   b) { return (a.v == b.v); }
	friend bool      operator!=(ModInt    a, ModInt   b) { return (a.v != b.v); }
	friend ModInt    operator+ (ModInt    a            ) { return ModInt(+a.v); }
	friend ModInt    operator- (ModInt    a            ) { return ModInt(-a.v); }
	friend ModInt    operator+ (ModInt    a, ModInt   b) { return ModInt(a.v + b.v); }
	friend ModInt    operator- (ModInt    a, ModInt   b) { return ModInt(a.v - b.v); }
	friend ModInt    operator* (ModInt    a, ModInt   b) { return ModInt(a.v * b.v); }
	friend ModInt    operator/ (ModInt    a, ModInt   b) { return a * b.inv(); }
	friend ModInt    operator^ (ModInt    a, LL       b) { return a.exp(b); }
	friend ModInt  & operator+=(ModInt  & a, ModInt   b) { return (a = a + b); }
	friend ModInt  & operator-=(ModInt  & a, ModInt   b) { return (a = a - b); }
	friend ModInt  & operator*=(ModInt  & a, ModInt   b) { return (a = a * b); }
	friend ModInt  & operator/=(ModInt  & a, ModInt   b) { return (a = a / b); }
	friend ModInt  & operator^=(ModInt  & a, LL       b) { return (a = a ^ b); }
	friend istream & operator>>(istream & s, ModInt & b) { s >> b.v; b = ModInt(b.v); return s; }
	friend ostream & operator<<(ostream & s, ModInt   b) { return (s << b.v); }
};

// ----

using MI = ModInt<1'000'000'007>;

int main() {
	vector<string> s = {
		"0222334-4-",
		"-2--3-4-42",
		"--2-334--2",
		"---2-34-42",
		"-33-243--3",
		"--33423--3",
		"-4443324-4",
		"-4-4---4-4",
		"------4-4-",
		"---------0",
	};
	Matrix<MI, 20> a;
	inc(i, 10) {
	inc(j, 10) {
		a[     i][     j] = (s[i][j] == '-' ? 0 : 1);
		a[10 + i][10 + j] = (s[i][j] == '-' ? 0 : 1);
		a[     i][10 + j] = (s[i][j] == '-' ? 0 : s[i][j] - '0');
	}
	}
	
	IN(LL, n);
	n++;
	OUT((a ^ n)[0][19]);
}

yukicoder

結果

テストケース

ソースコード