結果
問題 | No.800 四平方定理 |
ユーザー | kusomushi |
提出日時 | 2019-07-10 04:29:00 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 217 ms / 2,000 ms |
コード長 | 4,030 bytes |
コンパイル時間 | 3,285 ms |
コンパイル使用メモリ | 78,364 KB |
実行使用メモリ | 105,812 KB |
最終ジャッジ日時 | 2024-10-13 07:10:40 |
合計ジャッジ時間 | 7,089 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
37,696 KB |
testcase_01 | AC | 61 ms
38,412 KB |
testcase_02 | AC | 58 ms
37,896 KB |
testcase_03 | AC | 60 ms
38,032 KB |
testcase_04 | AC | 57 ms
37,880 KB |
testcase_05 | AC | 60 ms
37,696 KB |
testcase_06 | AC | 69 ms
38,560 KB |
testcase_07 | AC | 64 ms
38,576 KB |
testcase_08 | AC | 76 ms
39,720 KB |
testcase_09 | AC | 62 ms
38,388 KB |
testcase_10 | AC | 133 ms
72,596 KB |
testcase_11 | AC | 124 ms
75,060 KB |
testcase_12 | AC | 128 ms
75,644 KB |
testcase_13 | AC | 120 ms
71,660 KB |
testcase_14 | AC | 120 ms
73,936 KB |
testcase_15 | AC | 134 ms
75,860 KB |
testcase_16 | AC | 122 ms
74,300 KB |
testcase_17 | AC | 122 ms
74,288 KB |
testcase_18 | AC | 136 ms
78,388 KB |
testcase_19 | AC | 136 ms
78,188 KB |
testcase_20 | AC | 52 ms
36,908 KB |
testcase_21 | AC | 51 ms
36,836 KB |
testcase_22 | AC | 135 ms
78,296 KB |
testcase_23 | AC | 190 ms
105,812 KB |
testcase_24 | AC | 172 ms
101,752 KB |
testcase_25 | AC | 190 ms
105,532 KB |
testcase_26 | AC | 53 ms
36,864 KB |
testcase_27 | AC | 54 ms
40,988 KB |
testcase_28 | AC | 178 ms
101,508 KB |
testcase_29 | AC | 184 ms
103,716 KB |
testcase_30 | AC | 215 ms
101,688 KB |
testcase_31 | AC | 201 ms
97,364 KB |
testcase_32 | AC | 217 ms
102,280 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()); } }