#991459 (C++11) No.2798 Multiple Chain

提出ソース

結果

問題	No.2798 Multiple Chain
ユーザー	leaf_1415
提出日時	2024-06-28 22:02:52
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	28 ms / 2,000 ms
コード長	12,065 bytes
コンパイル時間	1,828 ms
コンパイル使用メモリ	130,612 KB
実行使用メモリ	5,888 KB
最終ジャッジ日時	2024-06-28 22:02:56
合計ジャッジ時間	3,776 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	10 ms 5,760 KB
testcase_01	AC	10 ms 5,888 KB
testcase_02	AC	10 ms 5,760 KB
testcase_03	AC	10 ms 5,632 KB
testcase_04	AC	10 ms 5,632 KB
testcase_05	AC	11 ms 5,760 KB
testcase_06	AC	10 ms 5,760 KB
testcase_07	AC	10 ms 5,760 KB
testcase_08	AC	10 ms 5,760 KB
testcase_09	AC	10 ms 5,760 KB
testcase_10	AC	9 ms 5,760 KB
testcase_11	AC	10 ms 5,760 KB
testcase_12	AC	10 ms 5,760 KB
testcase_13	AC	10 ms 5,760 KB
testcase_14	AC	10 ms 5,760 KB
testcase_15	AC	16 ms 5,760 KB
testcase_16	AC	14 ms 5,760 KB
testcase_17	AC	15 ms 5,760 KB
testcase_18	AC	14 ms 5,760 KB
testcase_19	AC	16 ms 5,760 KB
testcase_20	AC	10 ms 5,632 KB
testcase_21	AC	10 ms 5,632 KB
testcase_22	AC	10 ms 5,760 KB
testcase_23	AC	10 ms 5,760 KB
testcase_24	AC	11 ms 5,632 KB
testcase_25	AC	10 ms 5,760 KB
testcase_26	AC	10 ms 5,760 KB
testcase_27	AC	10 ms 5,760 KB
testcase_28	AC	11 ms 5,760 KB
testcase_29	AC	10 ms 5,760 KB
testcase_30	AC	10 ms 5,760 KB
testcase_31	AC	10 ms 5,760 KB
testcase_32	AC	16 ms 5,632 KB
testcase_33	AC	11 ms 5,760 KB
testcase_34	AC	28 ms 5,760 KB
testcase_35	AC	10 ms 5,632 KB
testcase_36	AC	10 ms 5,760 KB
testcase_37	AC	10 ms 5,632 KB
testcase_38	AC	13 ms 5,760 KB
testcase_39	AC	10 ms 5,760 KB
testcase_40	AC	10 ms 5,632 KB
testcase_41	AC	10 ms 5,760 KB
testcase_42	AC	9 ms 5,632 KB
testcase_43	AC	10 ms 5,760 KB
testcase_44	AC	10 ms 5,760 KB
testcase_45	AC	10 ms 5,760 KB
testcase_46	AC	10 ms 5,760 KB
testcase_47	AC	10 ms 5,760 KB
testcase_48	AC	10 ms 5,760 KB
testcase_49	AC	10 ms 5,760 KB
testcase_50	AC	10 ms 5,760 KB
testcase_51	AC	10 ms 5,760 KB
testcase_52	AC	16 ms 5,760 KB
testcase_53	AC	10 ms 5,760 KB

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

ソースコード

raw source code

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <array>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define pers(x, s) for(ll x = (ll)(s).size()-1; (x) >= 0; (x)--)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> using Preq = priority_queue<T>;
template<class T> using preq = priority_queue<T, vector<T>, greater<T>>;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};

const int mod = 998244353;
//const int mod = 1000000007;

struct mint{
	int x;
	mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
	mint(const mint &ope) {x = ope.x;}
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;}
	mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
	bool operator <(const mint &ope)const{return x < ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope = mint(t); return is;}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

ll modpow(ll a, ll n, ll mod){
	if(n == 0) return 1;
	if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod;
	else return modpow((a*a)%mod, n/2, mod) % mod;
}

vector<mint> fact, fact_inv;
void make_fact(int n){
	fact.resize(n+1), fact_inv.resize(n+1);
	fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
	fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }
mint divide(int n, int k){ if(n == 0 && k == 0) return 1; return comb(n+k-1, k-1); }
template<typename T> T comb2(ll n, ll k){ if(n < 0 || k < 0 || n < k) return T(0); T ret = 1; rep(i, 1, k) ret *= n-k+i, ret /= i; return ret;}
mint cat(ll w, ll h, ll b = 0){ return comb(w+h, w) - comb(w+h, h+b+1); } //b >= 0;

vector<ll> prime, pvec, qrime;
void make_prime(int n){
	prime.resize(n+1);
	rep(i, 2, n){
		if(prime[i] == 0) pvec.push_back(i), prime[i] = i;
		for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;}
	}
}
void make_qrime(int n){
	qrime.resize(n+1);
	rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];}
}
void factorize(ll n, map<ll, ll> &mp){
	mp.clear();
	for(auto p : pvec) while(n % p == 0) mp[p]++, n /= p;
	if(n > 1) mp[n]++;
}

template<typename S, typename T, typename U> bool isin(S x, T l, U r){return l <= x && x <= r;}
template<typename T> bool isdigit(T c){return isin(c, '0', '9');}
template<typename T> bool islower(T c){return isin(c, 'a', 'z');}
template<typename T> bool isupper(T c){return isin(c, 'A', 'Z');}

bool exceed(ll x, ll y, ll m){return y > 0 && x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;}
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
template<typename T> T arith(T x){return x*(x+1)/2;}
template<typename T> T arith2(T x){return x*(x+1)*(x*2+1)/6;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x, ll b = 10){if(x == 0) return "0"; string ret; for(;x;x/=b) ret += x % b + '0'; reverse(all(ret)); return ret;}
ll stoll(string &s, ll b = 10){ll ret = 0; for(auto c : s) ret *= b, ret += c - '0'; return ret;}
template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());}
int popcount(ull x){
	x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL);
	return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56;
}
template<typename T> vector<pair<T, ll>> rle(vector<T> vec){
	vector<pair<T, ll>> ret;
	for(auto x : vec){if(sz(ret) == 0 || ret.back().first != x) ret.push_back(P(x, 1)); else ret.back().second++;}
	return ret;
}
vector<pair<char, ll>> rle(string s){ vector<char> vec; for(auto c : s) vec.push_back(c); return rle(vec);}

template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;}
template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;}
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;}
template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;}
template<class T> T mdist(pair<T, T> s, pair<T, T> t){return abs(s.first-t.first) + abs(s.second-t.second);}
template<class T> T cdist(pair<T, T> s, pair<T, T> t){return max(abs(s.first-t.first), abs(s.second-t.second));}
template<class T> T edist2(pair<T, T> s, pair<T, T> t){return (s.first-t.first)*(s.first-t.first) + (s.second-t.second)*(s.second-t.second);}

template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i,  deq) os << deq[i] << " "; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;}
template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;}
template<typename T> void outg(T a[], ll sy, ll ty, ll sx, ll tx){rep(y, sy, ty){rep(x, sx, tx){cout << a[x][y]; if(x < tx) cout << " ";} cout << endl;}}
template<typename T, size_t N> ostream& operator << (ostream& os, array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
template<typename T, size_t N> ostream& operator << (ostream& os, const array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);}
template<typename T> void bssert(bool b, T t){ if(!b) cout << t << endl, exit(0); }


struct Factorize{
	static ll mul(ll a, ll n, ll mod){
		if(n == 0) return 0;
		if(n % 2){
			ll ret = a + mul(a, n-1, mod);
			if(ret >= mod) ret -= mod;
			return ret;
		}else{
			a *= 2;
			if(a >= mod) a -= mod;
			return mul(a, n/2, mod);
		}
	}
	static ll modpow(ll a, ll n, ll mod){
		if(n == 0) return 1;
		if(n % 2) return mul(a, modpow(a, n-1, mod), mod);
		else return modpow(mul(a, a, mod), n/2, mod);
	}
	static bool MillerRabin(ll n)
	{
		if(n == 1) return false;
		if(n == 2) return true;
		if(n % 2 == 0) return false;

		ll a[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
		for(int i = 0; i < 7; i++){
			if(a[i] % n == 0) continue;
			ll e = n-1;
			while(1){
				ll x = modpow(a[i]%n, e, n);
				if(x != 1 && x != n-1) return false;
				if(x == n-1 || e % 2) break;
				e /= 2;
			}
		}
		return true;
	}
	static ll func(ll x, ll c, ll n){
		x = mul(x, x, n) + c;
		if(x >= n) x -= n;
		return x;
	}
	static ll PollardsRho(ll n){
		if(n == 4) return 2;
		while(1){
			ll a = rand() % n, c = rand() % n, x = a, y = a;
			while(1){
				x = func(x, c, n), y = func(func(y, c, n), c, n);
				ll g = gcd(abs(x-y), n);
				if(g == n) break;
				if(g != 1) return g;
			}
		}
	}
	static void calc(ll n, vector<ll> &dest){
		if(n == 1) return;
		if(MillerRabin(n)){
			dest.push_back(n);
			return;
		}
		ll p = PollardsRho(n);
		if(MillerRabin(p)) dest.push_back(p);
		else calc(p, dest);
		calc(n/p, dest);
	}
	static void factorize(ll n, vector<ll> &dest)
	{
		srand(time(NULL));
		dest.clear();
		calc(n, dest);
		sort(dest.begin(), dest.end());
	}
};

ll n;
ll dp[65][65][65];
ll dpsum[65][65];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	dp[0][0][0] = 1;
	rep(i, 0, 62){
		rep(j, 0, 62){
			rep(k, 0, 62){
				if(dp[i][j][k] == 0) continue;
				rep(l, k, 62){
					if(j+l <= 62) dp[i+1][j+l][l] += dp[i][j][k];
				}
			}
		}
	}
	rep(i, 1, 62) rep(j, 1, 62) rep(k, 0, 62) dpsum[i][j] += dp[i][j][k];

	cin >> n;
	vector<ll> res;
	Factorize::factorize(n, res);

	map<ll, ll> mp;
	for(auto x : res) mp[x]++;
	vector<P> fvec;
	for(auto p : mp) fvec.pb(p);

	//outl(fvec);

	ll m = sz(fvec), M = 1<<m;
	ll ans = 1;
	rep(i, 1, M-1){
		rep(j, 2, 62){
			ll tmp = 1;
			reps(k, fvec){
				ll x = fvec[k].se;
				if(i & (1<<k)) tmp *= dpsum[j][x] - dpsum[j-1][x];
				else tmp *= dpsum[j-1][x];
			}
			ans += tmp;
		}
	}
	outl(ans);

	return 0;
}

yukicoder

結果

テストケース

ソースコード