結果
問題 | No.550 夏休みの思い出(1) |
ユーザー | uwi |
提出日時 | 2017-07-28 22:29:33 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 112 ms / 2,000 ms |
コード長 | 3,666 bytes |
コンパイル時間 | 4,152 ms |
コンパイル使用メモリ | 81,224 KB |
実行使用メモリ | 51,852 KB |
最終ジャッジ日時 | 2024-10-11 05:31:35 |
合計ジャッジ時間 | 11,115 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 99 ms
51,340 KB |
testcase_01 | AC | 112 ms
51,700 KB |
testcase_02 | AC | 73 ms
50,936 KB |
testcase_03 | AC | 73 ms
50,988 KB |
testcase_04 | AC | 73 ms
51,152 KB |
testcase_05 | AC | 74 ms
51,100 KB |
testcase_06 | AC | 74 ms
50,928 KB |
testcase_07 | AC | 74 ms
51,068 KB |
testcase_08 | AC | 74 ms
51,076 KB |
testcase_09 | AC | 101 ms
51,624 KB |
testcase_10 | AC | 100 ms
51,644 KB |
testcase_11 | AC | 100 ms
51,532 KB |
testcase_12 | AC | 100 ms
51,620 KB |
testcase_13 | AC | 103 ms
51,564 KB |
testcase_14 | AC | 101 ms
51,516 KB |
testcase_15 | AC | 100 ms
51,836 KB |
testcase_16 | AC | 101 ms
51,788 KB |
testcase_17 | AC | 100 ms
51,824 KB |
testcase_18 | AC | 99 ms
51,624 KB |
testcase_19 | AC | 99 ms
51,540 KB |
testcase_20 | AC | 99 ms
51,840 KB |
testcase_21 | AC | 100 ms
51,804 KB |
testcase_22 | AC | 92 ms
51,432 KB |
testcase_23 | AC | 99 ms
51,380 KB |
testcase_24 | AC | 97 ms
51,588 KB |
testcase_25 | AC | 83 ms
51,076 KB |
testcase_26 | AC | 82 ms
51,252 KB |
testcase_27 | AC | 82 ms
50,860 KB |
testcase_28 | AC | 82 ms
51,168 KB |
testcase_29 | AC | 95 ms
51,640 KB |
testcase_30 | AC | 94 ms
51,568 KB |
testcase_31 | AC | 99 ms
51,784 KB |
testcase_32 | AC | 100 ms
51,772 KB |
testcase_33 | AC | 98 ms
51,544 KB |
testcase_34 | AC | 98 ms
51,588 KB |
testcase_35 | AC | 100 ms
51,552 KB |
testcase_36 | AC | 98 ms
51,432 KB |
testcase_37 | AC | 97 ms
51,608 KB |
testcase_38 | AC | 99 ms
51,588 KB |
testcase_39 | AC | 100 ms
51,468 KB |
testcase_40 | AC | 102 ms
51,848 KB |
testcase_41 | AC | 99 ms
51,464 KB |
testcase_42 | AC | 96 ms
51,588 KB |
testcase_43 | AC | 82 ms
51,124 KB |
testcase_44 | AC | 83 ms
50,748 KB |
testcase_45 | AC | 82 ms
50,976 KB |
testcase_46 | AC | 85 ms
51,228 KB |
testcase_47 | AC | 96 ms
51,852 KB |
testcase_48 | AC | 103 ms
51,676 KB |
testcase_49 | AC | 102 ms
51,696 KB |
testcase_50 | AC | 102 ms
51,592 KB |
testcase_51 | AC | 100 ms
51,776 KB |
testcase_52 | AC | 102 ms
51,740 KB |
testcase_53 | AC | 102 ms
51,632 KB |
testcase_54 | AC | 103 ms
51,568 KB |
testcase_55 | AC | 104 ms
51,464 KB |
testcase_56 | AC | 102 ms
51,364 KB |
testcase_57 | AC | 104 ms
51,512 KB |
ソースコード
package contest170728; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class D { InputStream is; PrintWriter out; String INPUT = ""; void solve() { long a = nl(), b = nl(), c = nl(); for(long i = -1000000;i <= 1000000;i++){ double ii = i; double v = ii*ii*ii+a*ii*ii+b*ii+c; if(Math.abs(v) > 1e18)continue; if(i*i*i+a*i*i+b*i+c == 0){ long j = -i; long a2 = a-j; long b2 = b-j*(a-j); long ins = a2*a2-4L*b2; long s = sqrt(ins); long alpha = (-a2 + s) / 2; long beta = (-a2 - s) / 2; long[] as = {alpha, beta, i}; Arrays.sort(as); for(long w : as){ out.print(w + " "); } out.println(); return; } } } public static long sqrt(long n) { long i = Math.max(0, (long)Math.sqrt(n)-2); while(i*i <= n)i++; return i-1; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }