#568151 (C++14) No.1259 スイッチ

提出ソース

結果

問題	No.1259 スイッチ
ユーザー	torisasami4
提出日時	2020-10-16 23:39:52
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	478 ms / 2,000 ms
コード長	5,198 bytes
コンパイル時間	2,125 ms
コンパイル使用メモリ	178,172 KB
実行使用メモリ	38,400 KB
最終ジャッジ日時	2024-07-21 00:19:34
合計ジャッジ時間	18,349 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	78 ms 34,440 KB
testcase_01	AC	78 ms 34,432 KB
testcase_02	AC	77 ms 34,596 KB
testcase_03	AC	77 ms 34,416 KB
testcase_04	AC	77 ms 34,432 KB
testcase_05	AC	77 ms 34,432 KB
testcase_06	AC	78 ms 34,480 KB
testcase_07	AC	78 ms 34,432 KB
testcase_08	AC	79 ms 34,432 KB
testcase_09	AC	79 ms 34,512 KB
testcase_10	AC	310 ms 36,864 KB
testcase_11	AC	462 ms 38,272 KB
testcase_12	AC	300 ms 36,864 KB
testcase_13	AC	207 ms 35,856 KB
testcase_14	AC	264 ms 36,396 KB
testcase_15	AC	202 ms 35,840 KB
testcase_16	AC	384 ms 37,496 KB
testcase_17	AC	254 ms 36,352 KB
testcase_18	AC	427 ms 38,016 KB
testcase_19	AC	420 ms 37,920 KB
testcase_20	AC	321 ms 36,960 KB
testcase_21	AC	465 ms 38,216 KB
testcase_22	AC	199 ms 35,584 KB
testcase_23	AC	457 ms 37,760 KB
testcase_24	AC	326 ms 37,120 KB
testcase_25	AC	320 ms 36,992 KB
testcase_26	AC	463 ms 38,400 KB
testcase_27	AC	388 ms 37,596 KB
testcase_28	AC	330 ms 36,992 KB
testcase_29	AC	394 ms 37,592 KB
testcase_30	AC	83 ms 34,556 KB
testcase_31	AC	85 ms 34,432 KB
testcase_32	AC	82 ms 34,560 KB
testcase_33	AC	88 ms 34,432 KB
testcase_34	AC	82 ms 34,432 KB
testcase_35	AC	86 ms 34,432 KB
testcase_36	AC	86 ms 34,560 KB
testcase_37	AC	85 ms 34,432 KB
testcase_38	AC	84 ms 34,412 KB
testcase_39	AC	87 ms 34,560 KB
testcase_40	AC	88 ms 34,560 KB
testcase_41	AC	85 ms 34,508 KB
testcase_42	AC	87 ms 34,432 KB
testcase_43	AC	84 ms 34,520 KB
testcase_44	AC	87 ms 34,432 KB
testcase_45	AC	88 ms 34,516 KB
testcase_46	AC	84 ms 34,448 KB
testcase_47	AC	89 ms 34,432 KB
testcase_48	AC	82 ms 34,432 KB
testcase_49	AC	87 ms 34,432 KB
testcase_50	AC	285 ms 36,640 KB
testcase_51	AC	186 ms 35,712 KB
testcase_52	AC	445 ms 38,072 KB
testcase_53	AC	235 ms 36,128 KB
testcase_54	AC	454 ms 38,140 KB
testcase_55	AC	180 ms 35,480 KB
testcase_56	AC	259 ms 36,340 KB
testcase_57	AC	417 ms 37,760 KB
testcase_58	AC	304 ms 36,700 KB
testcase_59	AC	363 ms 37,376 KB
testcase_60	AC	478 ms 38,392 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define lscan(x) scanf("%I64d", &x)
#define lprint(x) printf("%I64d", x)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, n) for (ll i = n - 1; i >= 0; i--)
const int mod = 1e9 + 7;

ll gcd(ll a, ll b)
{
	ll c = a % b;
	while (c != 0)
	{
		a = b;
		b = c;
		c = a % b;
	}
	return b;
}

long long extGCD(long long a, long long b, long long &x, long long &y)
{
	if (b == 0)
	{
		x = 1;
		y = 0;
		return a;
	}
	long long d = extGCD(b, a % b, y, x);
	y -= a / b * x;
	return d;
}

struct UnionFind
{
	vector<ll> data;

	UnionFind(int sz)
	{
		data.assign(sz, -1);
	}

	bool unite(int x, int y)
	{
		x = find(x), y = find(y);
		if (x == y)
			return (false);
		if (data[x] > data[y])
			swap(x, y);
		data[x] += data[y];
		data[y] = x;
		return (true);
	}

	int find(int k)
	{
		if (data[k] < 0)
			return (k);
		return (data[k] = find(data[k]));
	}

	ll size(int k)
	{
		return (-data[find(k)]);
	}
};

ll M = 1000000007;

vector<ll> fac(2000011);  //n!(mod M)
vector<ll> ifac(2000011); //k!^{M-2} (mod M)

ll mpow(ll x, ll n)
{
	ll ans = 1;
	while (n != 0)
	{
		if (n & 1)
			ans = ans * x % M;
		x = x * x % M;
		n = n >> 1;
	}
	return ans;
}
ll mpow2(ll x, ll n, ll mod)
{
	ll ans = 1;
	while (n != 0)
	{
		if (n & 1)
			ans = ans * x % mod;
		x = x * x % mod;
		n = n >> 1;
	}
	return ans;
}
void setcomb()
{
	fac[0] = 1;
	ifac[0] = 1;
	for (ll i = 0; i < 2000010; i++)
	{
		fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
	}
	ifac[2000010] = mpow(fac[2000010], M - 2);
	for (ll i = 2000010; i > 0; i--)
	{
		ifac[i - 1] = ifac[i] * i % M;
	}
}
ll comb(ll a, ll b)
{
	if (a == 0 && b == 0)
		return 1;
	if (a < b || a < 0)
		return 0;
	ll tmp = ifac[a - b] * ifac[b] % M;
	return tmp * fac[a] % M;
}
ll perm(ll a, ll b)
{
	if (a == 0 && b == 0)
		return 1;
	if (a < b || a < 0)
		return 0;
	return fac[a] * ifac[a - b] % M;
}
long long modinv(long long a)
{
	long long b = M, u = 1, v = 0;
	while (b)
	{
		long long t = a / b;
		a -= t * b;
		swap(a, b);
		u -= t * v;
		swap(u, v);
	}
	u %= M;
	if (u < 0)
		u += M;
	return u;
}
ll modinv2(ll a, ll mod)
{
	ll b = mod, u = 1, v = 0;
	while (b)
	{
		ll t = a / b;
		a -= t * b;
		swap(a, b);
		u -= t * v;
		swap(u, v);
	}
	u %= mod;
	if (u < 0)
		u += mod;
	return u;
}

template <int mod>
struct ModInt
{
	int x;

	ModInt() : x(0) {}

	ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

	ModInt &operator+=(const ModInt &p)
	{
		if ((x += p.x) >= mod)
			x -= mod;
		return *this;
	}

	ModInt &operator-=(const ModInt &p)
	{
		if ((x += mod - p.x) >= mod)
			x -= mod;
		return *this;
	}

	ModInt &operator*=(const ModInt &p)
	{
		x = (int)(1LL * x * p.x % mod);
		return *this;
	}

	ModInt &operator/=(const ModInt &p)
	{
		*this *= p.inverse();
		return *this;
	}

	ModInt operator-() const { return ModInt(-x); }

	ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

	ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

	ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

	ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

	bool operator==(const ModInt &p) const { return x == p.x; }

	bool operator!=(const ModInt &p) const { return x != p.x; }

	ModInt inverse() const
	{
		int a = x, b = mod, u = 1, v = 0, t;
		while (b > 0)
		{
			t = a / b;
			swap(a -= t * b, b);
			swap(u -= t * v, v);
		}
		return ModInt(u);
	}

	ModInt pow(int64_t n) const
	{
		ModInt ret(1), mul(x);
		while (n > 0)
		{
			if (n & 1)
				ret *= mul;
			mul *= mul;
			n >>= 1;
		}
		return ret;
	}

	friend ostream &operator<<(ostream &os, const ModInt &p)
	{
		return os << p.x;
	}

	friend istream &operator>>(istream &is, ModInt &a)
	{
		int64_t t;
		is >> t;
		a = ModInt<mod>(t);
		return (is);
	}

	static int get_mod() { return mod; }
};

using mint = ModInt<mod>;

typedef vector<vector<mint>> Matrix;

Matrix mul(Matrix a, Matrix b)
{
	int i, j, k;
	mint t;
	int n = a.size(), m = b[0].size(), l = a[0].size();
	Matrix c(n, vector<mint>(m));
	for (i = 0; i < n; i++)
	{
		for (j = 0; j < m; j++)
		{
			t = 0;
			for (k = 0; k < l; k++)
				t += a[i][k] * b[k][j];
			c[i][j] = t;
		}
	}
	return c;
}

Matrix mat_pow(Matrix x, ll n)
{
	ll k = x.size();
	Matrix ans(k, vector<mint>(k, 0));
	for (int i = 0; i < k; i++)
		ans[i][i] = 1;
	while (n != 0)
	{
		if (n & 1)
			ans = mul(ans, x);
		x = mul(x, x);
		n = n >> 1;
	}
	return ans;
}

int main()
{
	ll n, k, m;
	cin >> n >> k >> m;
	setcomb();
	mint ans = 0;
	if (m == 1){
		rep(i,n){
			if(k%(i+1)==0){
				mint res = mpow(n, n - (i + 1));
				res *= fac[i];
				res *= comb(n - 1, i);
				ans += res;
			}
		}
	}
	else{
		mint sum[n+1];
		sum[0] = 1;
		mint p = n;
		rep(i, n) sum[i + 1] = sum[i] + p * ifac[i + 1], p *= n;
		rep(i, n - 1){
			if(k%(i+2)!=0){
				mint res = mpow(n, n - (i + 2));
				res *= perm(n - 2, i);
				ans += res;
			}
		}
		rep(i,n-1){
			mint res = perm(n - 2, i);
			res *= sum[n - 2 - i] * fac[n - 2 - i];
			ans += res;
		}
	}
	cout << ans << endl;
}

yukicoder

結果

テストケース

ソースコード