結果

問題 No.551 夏休みの思い出（２）
ユーザー tanzakutanzaku
提出日時 2017-07-28 22:42:53
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 7,246 bytes
コンパイル時間 4,178 ms
コンパイル使用メモリ 91,212 KB
実行使用メモリ 56,012 KB
最終ジャッジ日時 2024-10-10 03:27:02
合計ジャッジ時間 13,457 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 86 ms
53,048 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 132 ms
53,508 KB
testcase_05 AC 174 ms
53,796 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 85 ms
51,456 KB
testcase_09 WA -
testcase_10 AC 87 ms
51,364 KB
testcase_11 AC 86 ms
51,748 KB
testcase_12 WA -
testcase_13 AC 90 ms
53,100 KB
testcase_14 WA -
testcase_15 AC 87 ms
51,220 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 88 ms
53,164 KB
testcase_22 WA -
testcase_23 AC 87 ms
51,428 KB
testcase_24 AC 86 ms
51,460 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 224 ms
54,120 KB
testcase_28 WA -
testcase_29 AC 202 ms
53,504 KB
testcase_30 AC 263 ms
54,080 KB
testcase_31 WA -
testcase_32 AC 255 ms
54,116 KB
testcase_33 WA -
testcase_34 AC 217 ms
53,916 KB
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 AC 229 ms
54,084 KB
testcase_39 WA -
testcase_40 WA -
testcase_41 AC 302 ms
54,244 KB
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 AC 249 ms
53,920 KB
testcase_47 AC 84 ms
51,568 KB
testcase_48 AC 95 ms
51,596 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class no551 {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
		long p = io.nextInt();
		long r = io.nextInt();
		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
//		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			long a = io.nextInt();
			long b = io.nextInt();
			long c = io.nextInt();
			long d = round(b*b-4*a*c, p);
//			dump(a, b, c, d, tonelliShanks(d, p));
//			dump(tonelliShanks(d, p));
			long[] sq = tonelliShanks(d, p);
			if (sq == null) {
				io.out.println(-1);
				continue;
			}
			long iv = powmod(2*a, p - 2, p) % p;
			long ans1 = round((-b + sq[0]) % p * iv, p);
			long ans2 = round((-b - sq[0]) % p * iv, p);
			if (ans1 > ans2) { long t = ans1; ans1 = ans2; ans2 = t; }
			if (ans1 == ans2) {
				io.out.println(ans1);
			} else {
				io.out.println(ans1 + " " + ans2);
			}
		}
	}
	
	long round(long x, long p) {
		return (x%p+p)%p;
	}

	long[] tonelliShanks(final long n, final long mod) {
		if (n == 0) return new long[]{0,0};
		
		long Q = mod - 1;
		int S = 0;
		
		while(Q % 2 == 0) {
			Q /= 2;
			S++;
		}
		
		if(S == 1) {
			long v = powmod(n, (mod + 1) / 4, mod);
			return new long[] { mod-v, v, };
		}
		
		int z = 2;
		for(; ; z++) {
			if(powmod(z, (mod - 1) / 2, mod) == mod - 1) {
				break;
			}
		}

		long c = powmod(z, Q, mod);
		long R = powmod(n, (Q + 1) / 2, mod);
		long t = powmod(n, Q, mod);
		long M = S;
		
		while(t != 1) {
			long curT = t;
			for(int i = 1; i < M; i++) {
				if(powmod(t, powmod(2, i, mod - 1), mod) == 1) {
					long b = powmod(c, powmod(2, M - i - 1, mod - 1), mod);
					R = R * b % mod;
					c = b * b % mod;
					t = t * c % mod;
					M = i;
					break;
				}
			}
			if (curT == t) return null;
//			dump(t);
		}
		
		return new long[]{ R, (mod - R), };
	}
	
	
	static long powmod(long n, long r, long m) {
		long res = 1;
		for(; r != 0; r >>>= 1, n = n * n % m) {
			if((r&1) == 1) {
				res = res * n;
				if(res >= m) {
					res %= m;
				}
			}
		}
		return res;
	}

	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }

	void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new no551().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0