#611845 (C++17) No.1258 コインゲーム

提出ソース

結果

問題	No.1258 コインゲーム
ユーザー	tkmst201
提出日時	2021-01-31 12:29:51
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	75 ms / 2,000 ms
コード長	3,847 bytes
コンパイル時間	2,079 ms
コンパイル使用メモリ	201,840 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-28 21:33:39
合計ジャッジ時間	8,718 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	16 ms 6,816 KB
testcase_01	AC	19 ms 6,940 KB
testcase_02	AC	8 ms 6,940 KB
testcase_03	AC	60 ms 6,944 KB
testcase_04	AC	69 ms 6,944 KB
testcase_05	AC	12 ms 6,940 KB
testcase_06	AC	50 ms 6,944 KB
testcase_07	AC	6 ms 6,944 KB
testcase_08	AC	6 ms 6,944 KB
testcase_09	AC	27 ms 6,944 KB
testcase_10	AC	63 ms 6,940 KB
testcase_11	AC	66 ms 6,944 KB
testcase_12	AC	49 ms 6,940 KB
testcase_13	AC	17 ms 6,940 KB
testcase_14	AC	6 ms 6,944 KB
testcase_15	AC	58 ms 6,940 KB
testcase_16	AC	13 ms 6,940 KB
testcase_17	AC	67 ms 6,940 KB
testcase_18	AC	25 ms 6,940 KB
testcase_19	AC	23 ms 6,940 KB
testcase_20	AC	48 ms 6,944 KB
testcase_21	AC	62 ms 6,944 KB
testcase_22	AC	44 ms 6,944 KB
testcase_23	AC	32 ms 6,940 KB
testcase_24	AC	13 ms 6,940 KB
testcase_25	AC	31 ms 6,940 KB
testcase_26	AC	26 ms 6,944 KB
testcase_27	AC	60 ms 6,940 KB
testcase_28	AC	17 ms 6,944 KB
testcase_29	AC	18 ms 6,944 KB
testcase_30	AC	75 ms 6,944 KB
testcase_31	AC	20 ms 6,944 KB
testcase_32	AC	9 ms 6,944 KB
testcase_33	AC	50 ms 6,940 KB
testcase_34	AC	62 ms 6,940 KB
testcase_35	AC	23 ms 6,944 KB
testcase_36	AC	61 ms 6,944 KB
testcase_37	AC	24 ms 6,944 KB
testcase_38	AC	58 ms 6,944 KB
testcase_39	AC	18 ms 6,944 KB
testcase_40	AC	73 ms 6,940 KB
testcase_41	AC	73 ms 6,944 KB
testcase_42	AC	72 ms 6,944 KB
testcase_43	AC	72 ms 6,940 KB
testcase_44	AC	72 ms 6,940 KB
testcase_45	AC	72 ms 6,940 KB
testcase_46	AC	73 ms 6,940 KB
testcase_47	AC	73 ms 6,944 KB
testcase_48	AC	73 ms 6,944 KB
testcase_49	AC	73 ms 6,940 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

template<int M>
struct ModInt {
	static_assert(M > 0);
	
public:
	using value_type = int;
	using calc_type = std::int_fast64_t;
	
private:
	value_type val_;
	
public:
	constexpr ModInt(calc_type val = 0) : val_(val < 0 ? (val % M + M) % M : val % M) {}
	constexpr const value_type & val() const noexcept { return val_; }
	constexpr static decltype(M) mod() noexcept { return M; }
	
	explicit constexpr operator bool() const noexcept { return val_; }
	constexpr bool operator !() const noexcept { return !static_cast<bool>(*this); }
	constexpr ModInt operator +() const noexcept { return ModInt(*this); }
	constexpr ModInt operator -() const noexcept { return ModInt(-val_); }
	constexpr ModInt operator ++(int) noexcept { ModInt res = *this; ++*this; return res; }
	constexpr ModInt operator --(int) noexcept { ModInt res = *this; --*this; return res; }
	constexpr ModInt & operator ++() noexcept { val_ = val_ + 1 == M ? 0 : val_ + 1; return *this; }
	constexpr ModInt & operator --() noexcept { val_ = val_ == 0 ? M - 1 : val_ - 1; return *this; }
	constexpr ModInt & operator +=(const ModInt & rhs) noexcept { val_ += val_ < M - rhs.val_ ? rhs.val_ : rhs.val_ - M; return *this; }
	constexpr ModInt & operator -=(const ModInt & rhs) noexcept { val_ += val_ >= rhs.val_ ? -rhs.val_ : M - rhs.val_; return *this; }
	constexpr ModInt & operator *=(const ModInt & rhs) noexcept { val_ = static_cast<calc_type>(val_) * rhs.val_ % M; return *this; }
	constexpr ModInt & operator /=(const ModInt & rhs) noexcept { return *this *= rhs.inv(); }
	friend constexpr ModInt operator +(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) += rhs; }
	friend constexpr ModInt operator -(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) -= rhs; }
	friend constexpr ModInt operator *(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) *= rhs; }
	friend constexpr ModInt operator /(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) /= rhs; }
	friend constexpr bool operator ==(const ModInt & lhs, const ModInt & rhs) noexcept { return lhs.val_ == rhs.val_; }
	friend constexpr bool operator !=(const ModInt & lhs, const ModInt & rhs) noexcept { return !(lhs == rhs); }
	friend std::ostream & operator <<(std::ostream & os, const ModInt & rhs) { return os << rhs.val_; }
	friend std::istream & operator >>(std::istream & is, ModInt & rhs) { calc_type x; is >> x; rhs = ModInt(x); return is; }
	
	constexpr ModInt pow(calc_type n) const noexcept {
		ModInt res = 1, x = val_;
		if (n < 0) { x = x.inv(); n = -n; }
		while (n) { if (n & 1) res *= x; x *= x; n >>= 1; }
		return res;
	}
	
	constexpr ModInt inv() const noexcept {
		value_type a = val_, a1 = 1, a2 = 0, b = M, b1 = 0, b2 = 1;
		while (b > 0) {
			value_type q = a / b, r = a % b;
			value_type nb1 = a1 - q * b1, nb2 = a2 - q * b2;
			a = b; b = r;
			a1 = b1; b1 = nb1;
			a2 = b2; b2 = nb2;
		}
		assert(a == 1);
		return a1;
	}
};
using mint = ModInt<MOD>;

int main() {
	int S;
	cin >> S;
	while (S--) {
		int N, M, X;
		scanf("%d %d %d", &N, &M, &X);
		mint p = mint(1 - M).pow(N);
		mint q = mint(1 + M).pow(N);
		if (X == 0) printf("%d\n", ((p + q) / 2).val());
		else printf("%d\n", ((q - p) / 2).val());
	}
}

yukicoder

結果

テストケース

ソースコード