結果
問題 | No.800 四平方定理 |
ユーザー | uwi |
提出日時 | 2019-03-18 01:08:45 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,504 ms / 2,000 ms |
コード長 | 3,759 bytes |
コンパイル時間 | 6,105 ms |
コンパイル使用メモリ | 81,052 KB |
実行使用メモリ | 88,660 KB |
最終ジャッジ日時 | 2023-09-22 16:24:30 |
合計ジャッジ時間 | 26,959 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 80 ms
52,384 KB |
testcase_01 | AC | 91 ms
52,836 KB |
testcase_02 | AC | 85 ms
52,008 KB |
testcase_03 | AC | 86 ms
52,400 KB |
testcase_04 | AC | 81 ms
52,636 KB |
testcase_05 | AC | 86 ms
51,884 KB |
testcase_06 | AC | 97 ms
52,808 KB |
testcase_07 | AC | 87 ms
52,284 KB |
testcase_08 | AC | 89 ms
52,652 KB |
testcase_09 | AC | 93 ms
52,548 KB |
testcase_10 | AC | 665 ms
69,508 KB |
testcase_11 | AC | 769 ms
73,940 KB |
testcase_12 | AC | 825 ms
73,932 KB |
testcase_13 | AC | 644 ms
73,444 KB |
testcase_14 | AC | 687 ms
73,824 KB |
testcase_15 | AC | 808 ms
73,928 KB |
testcase_16 | AC | 712 ms
73,808 KB |
testcase_17 | AC | 692 ms
73,772 KB |
testcase_18 | AC | 862 ms
73,988 KB |
testcase_19 | AC | 845 ms
73,564 KB |
testcase_20 | AC | 41 ms
49,332 KB |
testcase_21 | AC | 41 ms
49,684 KB |
testcase_22 | AC | 889 ms
73,888 KB |
testcase_23 | AC | 1,504 ms
88,036 KB |
testcase_24 | AC | 1,214 ms
88,476 KB |
testcase_25 | AC | 1,495 ms
88,420 KB |
testcase_26 | AC | 42 ms
49,576 KB |
testcase_27 | AC | 43 ms
49,472 KB |
testcase_28 | AC | 1,214 ms
88,356 KB |
testcase_29 | AC | 1,383 ms
88,660 KB |
testcase_30 | AC | 1,208 ms
88,188 KB |
testcase_31 | AC | 1,121 ms
85,948 KB |
testcase_32 | AC | 1,313 ms
88,316 KB |
ソースコード
package contest190317; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; // 7 public class B { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), d = ni(); int[] f = new int[n*n]; int p = 0; for(int i = 1;i <= n;i++){ for(int j = 1;j <= n;j++){ f[p++] = i*i+j*j; } } Arrays.sort(f); long ans = 0; for(int i = 1;i <= n;i++){ for(int j = 1;j <= n;j++){ int g = i*i-j*j; ans += lowerBound(f, d+g+1) - lowerBound(f, d+g); } } out.println(ans); } public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); } public static int lowerBound(int[] a, int l, int r, int v) { if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException(); int low = l-1, high = r; while(high-low > 1){ int h = high+low>>>1; if(a[h] >= v){ high = h; }else{ low = h; } } return high; } 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 B().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)); } }