結果
問題 | No.800 四平方定理 |
ユーザー | kusomushi |
提出日時 | 2019-07-10 04:29:00 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 183 ms / 2,000 ms |
コード長 | 4,030 bytes |
コンパイル時間 | 3,000 ms |
コンパイル使用メモリ | 75,396 KB |
実行使用メモリ | 120,428 KB |
最終ジャッジ日時 | 2023-08-03 09:47:17 |
合計ジャッジ時間 | 8,268 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
47,676 KB |
testcase_01 | AC | 53 ms
50,544 KB |
testcase_02 | AC | 50 ms
49,708 KB |
testcase_03 | AC | 50 ms
49,852 KB |
testcase_04 | AC | 50 ms
50,172 KB |
testcase_05 | AC | 50 ms
49,568 KB |
testcase_06 | AC | 53 ms
50,728 KB |
testcase_07 | AC | 49 ms
49,488 KB |
testcase_08 | AC | 53 ms
52,712 KB |
testcase_09 | AC | 50 ms
50,080 KB |
testcase_10 | AC | 125 ms
88,204 KB |
testcase_11 | AC | 116 ms
89,724 KB |
testcase_12 | AC | 119 ms
89,764 KB |
testcase_13 | AC | 107 ms
87,476 KB |
testcase_14 | AC | 112 ms
89,824 KB |
testcase_15 | AC | 120 ms
91,812 KB |
testcase_16 | AC | 110 ms
89,728 KB |
testcase_17 | AC | 113 ms
90,120 KB |
testcase_18 | AC | 128 ms
93,896 KB |
testcase_19 | AC | 128 ms
93,748 KB |
testcase_20 | AC | 43 ms
47,576 KB |
testcase_21 | AC | 43 ms
49,568 KB |
testcase_22 | AC | 128 ms
93,728 KB |
testcase_23 | AC | 179 ms
120,428 KB |
testcase_24 | AC | 165 ms
116,508 KB |
testcase_25 | AC | 183 ms
118,540 KB |
testcase_26 | AC | 43 ms
49,548 KB |
testcase_27 | AC | 44 ms
53,644 KB |
testcase_28 | AC | 164 ms
116,292 KB |
testcase_29 | AC | 171 ms
118,584 KB |
testcase_30 | AC | 165 ms
116,268 KB |
testcase_31 | AC | 154 ms
112,240 KB |
testcase_32 | AC | 169 ms
116,264 KB |
ソースコード
import java.io.*; import java.util.Arrays; import java.util.StringJoiner; import java.util.StringTokenizer; import java.util.function.Function; public class Main { static int N, D; public static void main(String[] args) { FastScanner sc = new FastScanner(System.in); N = sc.nextInt(); D = sc.nextInt(); System.out.println(solve()); } static long solve() { int[] xy = new int[N*N*2 + 1]; int[] wz = new int[N*N*2 + D + 1]; for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { xy[i*i + j*j]++; if( i*i - j*j + D >= 0 ) { wz[i*i - j*j + D]++; } } } long ans = 0; for (int i = 1; i <= N*N*2; i++) { if( xy[i] > 0 && wz[i] > 0 ) { ans += xy[i] * wz[i]; } } return ans; } @SuppressWarnings("unused") static class FastScanner { private BufferedReader reader; private StringTokenizer tokenizer; FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } long nextLong() { return Long.parseLong(next()); } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } int[] nextIntArray(int n, int delta) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt() + delta; return a; } long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } } static <A> void writeLines(A[] as, Function<A, String> f) { PrintWriter pw = new PrintWriter(System.out); for (A a : as) { pw.println(f.apply(a)); } pw.flush(); } static void writeLines(int[] as) { PrintWriter pw = new PrintWriter(System.out); for (int a : as) pw.println(a); pw.flush(); } static void writeLines(long[] as) { PrintWriter pw = new PrintWriter(System.out); for (long a : as) pw.println(a); pw.flush(); } static int max(int... as) { int max = Integer.MIN_VALUE; for (int a : as) max = Math.max(a, max); return max; } static int min(int... as) { int min = Integer.MAX_VALUE; for (int a : as) min = Math.min(a, min); return min; } static void debug(Object... args) { StringJoiner j = new StringJoiner(" "); for (Object arg : args) { if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg)); else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg)); else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg)); else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg)); else j.add(arg.toString()); } System.err.println(j.toString()); } }