結果

問題 No.981 一般冪乗根
ユーザー Jaehyun KooJaehyun Koo
提出日時 2022-05-20 02:56:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 13 ms / 6,000 ms
コード長 6,366 bytes
コンパイル時間 3,587 ms
コンパイル使用メモリ 226,304 KB
実行使用メモリ 4,348 KB
最終ジャッジ日時 2023-10-19 11:46:15
合計ジャッジ時間 57,510 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
4,348 KB
testcase_01 AC 5 ms
4,348 KB
testcase_02 AC 5 ms
4,348 KB
testcase_03 AC 4 ms
4,348 KB
testcase_04 AC 4 ms
4,348 KB
testcase_05 AC 4 ms
4,348 KB
testcase_06 AC 4 ms
4,348 KB
testcase_07 AC 4 ms
4,348 KB
testcase_08 AC 4 ms
4,348 KB
testcase_09 AC 4 ms
4,348 KB
testcase_10 AC 4 ms
4,348 KB
testcase_11 AC 4 ms
4,348 KB
testcase_12 AC 4 ms
4,348 KB
testcase_13 AC 4 ms
4,348 KB
testcase_14 AC 3 ms
4,348 KB
testcase_15 AC 4 ms
4,348 KB
testcase_16 AC 4 ms
4,348 KB
testcase_17 AC 4 ms
4,348 KB
testcase_18 AC 4 ms
4,348 KB
testcase_19 AC 4 ms
4,348 KB
testcase_20 AC 4 ms
4,348 KB
testcase_21 AC 4 ms
4,348 KB
testcase_22 AC 4 ms
4,348 KB
testcase_23 AC 4 ms
4,348 KB
testcase_24 AC 4 ms
4,348 KB
testcase_25 AC 6 ms
4,348 KB
testcase_26 AC 4 ms
4,348 KB
testcase_27 AC 3 ms
4,348 KB
testcase_28 AC 13 ms
4,348 KB
evil_60bit1.txt AC 10 ms
4,348 KB
evil_60bit2.txt AC 11 ms
4,348 KB
evil_60bit3.txt AC 11 ms
4,348 KB
evil_hack AC 2 ms
4,348 KB
evil_hard_random AC 10 ms
4,348 KB
evil_hard_safeprime.txt AC 14 ms
4,348 KB
evil_hard_tonelli0 AC 25 ms
4,348 KB
evil_hard_tonelli1 AC 1,286 ms
4,348 KB
evil_hard_tonelli2 AC 84 ms
4,348 KB
evil_hard_tonelli3 AC 887 ms
4,348 KB
evil_sefeprime1.txt AC 14 ms
4,348 KB
evil_sefeprime2.txt AC 13 ms
4,348 KB
evil_sefeprime3.txt AC 14 ms
4,348 KB
evil_tonelli1.txt AC 1,903 ms
4,348 KB
evil_tonelli2.txt AC 1,903 ms
4,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long lint;
typedef pair<lint, lint> pi;
const int MAXN = 30005;
lint mod;

struct mint {
	lint val;
	mint() { val = 0; }
	mint(const lint& v) {
		val = (-mod <= v && v < mod) ? v : v % mod;
		if (val < 0) val += mod;
	}

	friend ostream& operator<<(ostream& os, const mint& a) { return os << a.val; }
	friend bool operator==(const mint& a, const mint& b) { return a.val == b.val; }
	friend bool operator!=(const mint& a, const mint& b) { return !(a == b); }
	friend bool operator<(const mint& a, const mint& b) { return a.val < b.val; }

	mint operator-() const { return mint(-val); }
	mint& operator+=(const mint& m) { if ((val += m.val) >= mod) val -= mod; return *this; }
	mint& operator-=(const mint& m) { if ((val -= m.val) < 0) val += mod; return *this; }
	mint& operator*=(const mint& m) { val = (__int128)val*m.val%mod; return *this; }
	friend mint ipow(mint a, lint p) {
		mint ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
		return ans;
	}
	friend mint inv(const mint& a) { assert(a.val); return ipow(a, mod - 2); }
	mint& operator/=(const mint& m) { return (*this) *= inv(m); }

	friend mint operator+(mint a, const mint& b) { return a += b; }
	friend mint operator-(mint a, const mint& b) { return a -= b; }
	friend mint operator*(mint a, const mint& b) { return a *= b; }
	friend mint operator/(mint a, const mint& b) { return a /= b; }
	operator int64_t() const {return val; }
};

lint mul(lint x, lint y, lint mod){ return (__int128) x * y % mod; }

lint ipow(lint x, lint y, lint p){
	lint ret = 1, piv = x % p;
	while(y){
		if(y&1) ret = mul(ret, piv, p);
		piv = mul(piv, piv, p);
		y >>= 1;
	}
	return ret;
}

namespace factors{
	bool miller_rabin(lint x, lint a){
		if(x % a == 0) return 0;
		lint d = x - 1;
		while(1){
			lint tmp = ipow(a, d, x);
			if(d&1) return (tmp != 1 && tmp != x-1);
			else if(tmp == x-1) return 0;
			d >>= 1;
		}
	}
	bool isprime(lint x){
		for(auto &i : {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37}){
			if(x == i) return 1;
			if(x > 40 && miller_rabin(x, i)) return 0;
		}
		if(x <= 40) return 0;
		return 1;
	}
	lint f(lint x, lint n, lint c){
		return (c + mul(x, x, n)) % n;
	}
	void rec(lint n, vector<lint> &v){
		if(n == 1) return;
		if(n % 2 == 0){
			v.push_back(2);
			rec(n/2, v);
			return;
		}
		if(isprime(n)){
			v.push_back(n);
			return;
		}
		lint a, b, c;
		while(1){
			a = rand() % (n-2) + 2;
			b = a;
			c = rand() % 20 + 1;
			do{
				a = f(a, n, c);
				b = f(f(b, n, c), n, c);
			}while(gcd(abs(a-b), n) == 1);
			if(a != b) break;
		}
		lint x = gcd(abs(a-b), n);
		rec(x, v);
		rec(n/x, v);
	}
	vector<lint> factorize(lint n){
		vector<lint> ret;
		rec(n, ret);
		sort(ret.begin(), ret.end());
		return ret;
	}
	lint euler_phi(lint n){
		auto pf = factorize(n);
		pf.resize(unique(all(pf)) - pf.begin());
		for(auto &p : pf){
			n -= n / p;
		}
		return n;
	}
};


namespace kth_root_mod {
	template <typename T>
		struct Memo {
			Memo(const T &g, int s, int _period){
				size = 1;
				while(2 * size <= min(s, _period)) size *= 2;
				mask = size - 1;
				period = _period;
				vs.resize(size);
				os.resize(size + 1);
				T x(1);
				for (int i = 0; i < size; ++i, x *= g) os[((lint)x) & mask]++;
				for (int i = 1; i < size; ++i) os[i] += os[i - 1];
				x = 1;
				for (int i = 0; i < size; ++i, x *= g) vs[--os[((lint)x) & mask]] = {x, i};
				gpow = x;
				os[size] = size;
			}
			int find(T x) const {
				for (int t = 0; t < period; t += size, x *= gpow) {
					for (int m = (((lint)x) & mask), i = os[m]; i < os[m + 1]; ++i) {
						if (x == vs[i].first) {
							int ret = vs[i].second - t;
							return ret < 0 ? ret + period : ret;
						}
					}
				}
				assert(0);
			}
			T gpow;
			int size, mask, period;
			vector<pair<T, int> > vs;
			vector<int> os;
		};


	lint inv(lint a, lint p) {
		lint b = p, x = 1, y = 0;
		while (a) {
			lint q = b / a;
			swap(a, b %= a);
			swap(x, y -= q * x);
		}
		assert(b == 1);
		return y < 0 ? y + p : y;
	}


	mint pe_root(lint c, lint pi, lint ei, lint p) {
		lint s = p - 1, t = 0;
		while (s % pi == 0) s /= pi, ++t;
		lint pe = 1;
		for (lint _ = 0; _ < ei; ++_) pe *= pi;

		lint u = inv(pe - s % pe, pe);
		mint mc = c, one = 1;
		mint z = ipow(mc, (s * u + 1) / pe);
		mint zpe = ipow(mc, s * u);
		if (zpe == one) return z;

		mint vs;
		{
			lint ptm1 = 1;
			for (lint _ = 0; _ < t - 1; ++_) ptm1 *= pi;
			for (mint v = 2;; v += one) {
				vs = ipow(v, s);
				if(ipow(vs, ptm1) != one) break;
			}
		}

		mint vspe = ipow(vs, pe);
		lint vs_e = ei;
		mint base = vspe;
		for (lint _ = 0; _ < t - ei - 1; _++) base = ipow(base, pi);
		Memo<mint> memo(base, (lint)(sqrt(t - ei) * sqrt(pi)) + 1, pi);

		while (zpe != one) {
			mint tmp = zpe;
			lint td = 0;
			while (tmp != one) ++td, tmp = ipow(tmp, pi);
			lint e = t - td;
			while (vs_e != e) {
				vs = ipow(vs, pi);
				vspe = ipow(vspe, pi);
				++vs_e;
			}

			// BS-GS ... find (zpe * ( vspe ^ n ) ) ^( p_i ^ (td - 1) ) = 1
			mint base_zpe = mint(1) / zpe;
			for (lint _ = 0; _ < td - 1; _++) base_zpe = ipow(base_zpe, pi);
			lint bsgs = memo.find(base_zpe);

			z *= ipow(vs, bsgs);
			zpe *= ipow(vspe, bsgs);
		}
		return z;
	}

	lint kth_root(lint a, lint k, lint p) {
		mod = p;
		a %= p;
		if (k == 0) return a == 1 ? a : -1;
		if (a <= 1 || k <= 1) return a;

		assert(p > 2);
		lint g = gcd(p - 1, k);
		if (ipow(mint(a), (p - 1) / g) != mint(1)) return -1;
		a = (lint)ipow(mint(a), inv(k / g, (p - 1) / g));
		unordered_map<lint, int> fac;
		for (auto &f : factors::factorize(g)) fac[f]++;
		for (auto pp : fac)
			a = pe_root(a, pp.first, pp.second, p);
		return a;
	}
}


int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tc; cin >> tc;
	while(tc--){
		lint k, y, p;
		cin >> k >> y >> p;
		cout << kth_root_mod::kth_root(p, y, k) << "\n";
	}
	/*
	   int n; cin >> n;
	   vector<pair<mint, mint>> v;
	   for(int i = 0; i < n; i++){
	   string s; cin >> s;
	   mint ans = 0;
	   for(auto &i : s){
	   ans = ans * mint(10) + mint(i - '0');
	   }
	   mint x = ipow(ans, mod / 2);
	   mint y = ipow(-ans, mod / 2);
	   cout << x*x << " " << y*y << "\n";
	   if(x * x != ans){
	   assert(y * y == -ans);
	   v.emplace_back(0, y);
	   }
	   else v.emplace_back(x, 0);
	   }
	 */
}
0