#192210 (Java21) No.550 夏休みの思い出（１）

提出ソース

結果

問題	No.550 夏休みの思い出（１）
ユーザー	tanzaku
提出日時	2017-07-28 23:26:20
言語	Java21 (openjdk 21)
結果	AC
実行時間	107 ms / 2,000 ms
コード長	6,667 bytes
コンパイル時間	4,392 ms
コンパイル使用メモリ	86,740 KB
実行使用メモリ	52,040 KB
最終ジャッジ日時	2024-10-11 05:32:33
合計ジャッジ時間	11,563 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	98 ms 51,264 KB
testcase_01	AC	94 ms 51,268 KB
testcase_02	AC	95 ms 51,596 KB
testcase_03	AC	93 ms 51,696 KB
testcase_04	AC	96 ms 51,804 KB
testcase_05	AC	100 ms 51,880 KB
testcase_06	AC	98 ms 51,728 KB
testcase_07	AC	96 ms 51,632 KB
testcase_08	AC	95 ms 51,280 KB
testcase_09	AC	95 ms 51,352 KB
testcase_10	AC	106 ms 51,604 KB
testcase_11	AC	96 ms 51,572 KB
testcase_12	AC	96 ms 51,444 KB
testcase_13	AC	95 ms 51,404 KB
testcase_14	AC	96 ms 51,796 KB
testcase_15	AC	98 ms 51,792 KB
testcase_16	AC	92 ms 51,240 KB
testcase_17	AC	94 ms 51,340 KB
testcase_18	AC	95 ms 51,540 KB
testcase_19	AC	96 ms 51,608 KB
testcase_20	AC	94 ms 51,452 KB
testcase_21	AC	92 ms 51,496 KB
testcase_22	AC	91 ms 51,516 KB
testcase_23	AC	95 ms 51,492 KB
testcase_24	AC	96 ms 51,280 KB
testcase_25	AC	97 ms 51,224 KB
testcase_26	AC	95 ms 51,492 KB
testcase_27	AC	93 ms 51,348 KB
testcase_28	AC	96 ms 51,652 KB
testcase_29	AC	94 ms 51,300 KB
testcase_30	AC	96 ms 51,640 KB
testcase_31	AC	95 ms 51,560 KB
testcase_32	AC	94 ms 51,568 KB
testcase_33	AC	94 ms 51,612 KB
testcase_34	AC	95 ms 51,480 KB
testcase_35	AC	95 ms 51,624 KB
testcase_36	AC	96 ms 51,596 KB
testcase_37	AC	107 ms 51,460 KB
testcase_38	AC	94 ms 51,376 KB
testcase_39	AC	100 ms 51,404 KB
testcase_40	AC	96 ms 51,340 KB
testcase_41	AC	93 ms 51,256 KB
testcase_42	AC	92 ms 51,228 KB
testcase_43	AC	92 ms 51,724 KB
testcase_44	AC	93 ms 51,260 KB
testcase_45	AC	94 ms 51,392 KB
testcase_46	AC	97 ms 51,536 KB
testcase_47	AC	94 ms 51,552 KB
testcase_48	AC	105 ms 51,924 KB
testcase_49	AC	102 ms 52,040 KB
testcase_50	AC	94 ms 51,600 KB
testcase_51	AC	97 ms 51,620 KB
testcase_52	AC	97 ms 51,356 KB
testcase_53	AC	96 ms 51,504 KB
testcase_54	AC	94 ms 51,588 KB
testcase_55	AC	94 ms 51,516 KB
testcase_56	AC	94 ms 51,416 KB
testcase_57	AC	97 ms 51,648 KB

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

ソースコード

raw source code

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

import static java.util.Arrays.*;

public class no547 {
//	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 {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			a = io.nextLong();
			b = io.nextLong();
			c = io.nextLong();
			ba = BigInteger.valueOf(a);
			bb = BigInteger.valueOf(b);
			bc = BigInteger.valueOf(c);
			BigInteger low = BigInteger.valueOf((long)-1e9);
			BigInteger high = BigInteger.valueOf((long)1e9);
			int sl = f(low).signum();
			int sr = f(high).signum();
			while (true) {
				BigInteger x = low.add(high).shiftRight(1);
				int s = f(x).signum();
				if (s == 0) {
					printArrayLn(solve(x));
					break;
				}
				if (s == sl) {
					low = x;
				} else {
					high = x;
				}
			}
		}
	}
	
	int[] solve(BigInteger x) {
		BigInteger ba2 = BigInteger.ONE;
		BigInteger bb2 = ba.add(x);
		BigInteger bc2 = bb.add(x.multiply(bb2));
		long sq = bb2.pow(2).subtract(BigInteger.valueOf(4).multiply(ba2).multiply(bc2)).longValueExact();
		sq = (long)Math.sqrt(sq);
//		dump(x, ba2, bb2, bc2);
		int[] res = new int[]{
				x.intValueExact(),
				(int)((-bb2.longValueExact()-sq)/(2*ba2.longValueExact())),
				(int)((-bb2.longValueExact()+sq)/(2*ba2.longValueExact())),
		};
		Arrays.sort(res);
		return res;
	}
	
	
	
	long a, b, c;
	BigInteger ba, bb, bc;
	BigInteger f(BigInteger x) {
		return x.add(ba).multiply(x).add(bb).multiply(x).add(bc);
	}

	/// 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 no547().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; }
	}
}

yukicoder

結果

テストケース

ソースコード