結果
問題 | No.981 一般冪乗根 |
ユーザー | 37zigen |
提出日時 | 2020-02-10 17:05:00 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 694 ms / 6,000 ms |
コード長 | 3,002 bytes |
コンパイル時間 | 2,530 ms |
コンパイル使用メモリ | 79,872 KB |
実行使用メモリ | 122,420 KB |
最終ジャッジ日時 | 2024-04-18 05:26:46 |
合計ジャッジ時間 | 104,779 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 438 ms
53,288 KB |
testcase_01 | AC | 458 ms
122,420 KB |
testcase_02 | AC | 478 ms
113,368 KB |
testcase_03 | AC | 455 ms
53,288 KB |
testcase_04 | AC | 454 ms
99,308 KB |
testcase_05 | AC | 326 ms
58,432 KB |
testcase_06 | AC | 323 ms
46,004 KB |
testcase_07 | AC | 326 ms
45,848 KB |
testcase_08 | AC | 311 ms
45,136 KB |
testcase_09 | AC | 324 ms
46,380 KB |
testcase_10 | AC | 324 ms
45,156 KB |
testcase_11 | AC | 325 ms
45,700 KB |
testcase_12 | AC | 329 ms
46,068 KB |
testcase_13 | AC | 324 ms
45,956 KB |
testcase_14 | AC | 315 ms
45,036 KB |
testcase_15 | AC | 317 ms
46,012 KB |
testcase_16 | AC | 319 ms
45,692 KB |
testcase_17 | AC | 333 ms
46,272 KB |
testcase_18 | AC | 320 ms
45,836 KB |
testcase_19 | AC | 313 ms
45,540 KB |
testcase_20 | AC | 317 ms
45,796 KB |
testcase_21 | AC | 319 ms
45,896 KB |
testcase_22 | AC | 329 ms
46,236 KB |
testcase_23 | AC | 320 ms
46,072 KB |
testcase_24 | AC | 325 ms
46,156 KB |
testcase_25 | AC | 619 ms
46,484 KB |
testcase_26 | AC | 481 ms
46,416 KB |
testcase_27 | AC | 247 ms
44,944 KB |
testcase_28 | AC | 694 ms
55,484 KB |
evil_60bit1.txt | AC | 873 ms
46,440 KB |
evil_60bit2.txt | AC | 866 ms
46,692 KB |
evil_60bit3.txt | AC | 909 ms
46,844 KB |
evil_hack | AC | 135 ms
41,456 KB |
evil_hard_random | AC | 853 ms
46,672 KB |
evil_hard_safeprime.txt | AC | 1,304 ms
46,788 KB |
evil_hard_tonelli0 | TLE | - |
evil_hard_tonelli1 | TLE | - |
evil_hard_tonelli2 | AC | 3,899 ms
58,012 KB |
evil_hard_tonelli3 | TLE | - |
evil_sefeprime1.txt | AC | 1,402 ms
46,840 KB |
evil_sefeprime2.txt | AC | 1,340 ms
46,620 KB |
evil_sefeprime3.txt | AC | 1,377 ms
49,152 KB |
evil_tonelli1.txt | TLE | - |
evil_tonelli2.txt | TLE | - |
ソースコード
import java.io.PrintWriter; import java.util.Arrays; import java.util.HashMap; import java.util.Scanner; class Main { public static void main(String[] args) throws Exception { new Main().run(); } void run() { Scanner sc = new Scanner(System.in); PrintWriter pw = new PrintWriter(System.out); int T = sc.nextInt(); for (int i = 0; i < T; ++i) { long p = sc.nextLong(); long k = sc.nextLong(); long a = sc.nextLong(); long kthroot = kth_root(a, k, p); pw.println(kthroot); } pw.close(); } long kth_root(long a, long k, long p) { long g = gcd(k, p - 1); if (pow(a, (p - 1) / g, p) != 1) return -1; a = pow(a, inv(k / g, (p - 1) / g), p); for (long div = 2; div * div <= g; ++div) { int sz = 0; while (g % div == 0) { g /= div; ++sz; } if (sz > 0) { long b = peth_root(a, div, sz, p); a = b; } } if (g > 1) a = peth_root(a, g, 1, p); return a; } long peth_root(long a, long p, int e, long mod) { long q = mod - 1; int s = 0; while (q % p == 0) { q /= p; ++s; } long pe = pow(p, e, mod); long ans = pow(a, (mul((pe - 1) , inv(q, pe) , pe) * q + 1) / pe, mod); long c = 2; while (pow(c, (mod - 1) / p, mod) == 1) ++c; c = pow(c, q, mod); HashMap<Long, Integer> map = new HashMap<>(); long add = 1; int v = (int) Math.sqrt(p) + 1; long mul = pow(c, mul(v, pow(p, s - 1, mod - 1),mod-1), mod); for (int i = 0; i <= v; ++i) { map.put(add, i); add = mul(add , mul , mod); } mul = inv(pow(c, pow(p, s - 1, mod - 1), mod), mod); out: for (int i = e; i < s; ++i) { long err = mul(inv(pow(ans, pe, mod), mod) , a , mod); long target = pow(err, pow(p, s - 1 - i, mod - 1), mod); for (int j = 0; j <= v; ++j) { if (map.containsKey(target)) { int x = map.get(target); ans = mul(ans , pow(c, mul((j + v * x) , pow(p, i - e, mod - 1) , (mod - 1)), mod) , mod); continue out; } target = mul(target , mul , mod); } throw new AssertionError(); } return ans; } int cnt(long a, long base, long p) { int ret = 0; while (a != 1) { a = pow(a, base, p); ++ret; } return ret; } long inv(long a, long p) { a %= p; long u = 1, v = 0; long b = p; while (b > 0) { long q = a / b; a %= b; u -=mul(v , q , p); u = (u%p+p)%p; { u ^= v; v ^= u; u ^= v; a ^= b; b ^= a; a ^= b; } } return u < 0 ? u + p : u; } long pow(long a, long n, long p) { n %= p - 1; long r = 1; for (; n > 0; n >>= 1, a = mul(a , a , p)) if (n % 2 == 1) r = mul(r , a, p); return r; } long gcd(long a, long b) { return a == 0 ? b : gcd(b % a, a); } long mul(long a,long b,long p) { if(a<0||b<0)throw new AssertionError(); if(a>b)return mul(b,a,p); else if(a==0)return 0; else if(a==1)return b; else if(a%2==0)return mul(a/2,b*2%p,p)%p; else return (b+mul(a-1,b,p))%p; } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }