結果
問題 | No.800 四平方定理 |
ユーザー | EmKjp |
提出日時 | 2019-05-01 14:14:32 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 262 ms / 2,000 ms |
コード長 | 3,784 bytes |
コンパイル時間 | 3,667 ms |
コンパイル使用メモリ | 107,268 KB |
実行使用メモリ | 74,608 KB |
最終ジャッジ日時 | 2023-08-30 04:20:59 |
合計ジャッジ時間 | 11,075 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
20,804 KB |
testcase_01 | AC | 59 ms
23,268 KB |
testcase_02 | AC | 58 ms
21,064 KB |
testcase_03 | AC | 58 ms
23,036 KB |
testcase_04 | AC | 58 ms
23,068 KB |
testcase_05 | AC | 57 ms
21,020 KB |
testcase_06 | AC | 58 ms
21,456 KB |
testcase_07 | AC | 58 ms
23,252 KB |
testcase_08 | AC | 58 ms
19,372 KB |
testcase_09 | AC | 58 ms
21,456 KB |
testcase_10 | AC | 136 ms
44,880 KB |
testcase_11 | AC | 146 ms
49,040 KB |
testcase_12 | AC | 149 ms
49,944 KB |
testcase_13 | AC | 137 ms
50,404 KB |
testcase_14 | AC | 149 ms
50,196 KB |
testcase_15 | AC | 163 ms
50,228 KB |
testcase_16 | AC | 151 ms
48,428 KB |
testcase_17 | AC | 151 ms
48,636 KB |
testcase_18 | AC | 163 ms
54,316 KB |
testcase_19 | AC | 163 ms
54,324 KB |
testcase_20 | AC | 56 ms
22,760 KB |
testcase_21 | AC | 57 ms
20,720 KB |
testcase_22 | AC | 170 ms
52,484 KB |
testcase_23 | AC | 262 ms
74,608 KB |
testcase_24 | AC | 232 ms
72,756 KB |
testcase_25 | AC | 255 ms
72,420 KB |
testcase_26 | AC | 55 ms
20,752 KB |
testcase_27 | AC | 56 ms
20,828 KB |
testcase_28 | AC | 225 ms
68,468 KB |
testcase_29 | AC | 239 ms
72,576 KB |
testcase_30 | AC | 226 ms
68,504 KB |
testcase_31 | AC | 214 ms
63,268 KB |
testcase_32 | AC | 239 ms
73,208 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Collections.Generic; using System.Globalization; using System.Linq; using System.Text; partial class Solver { public void Run() { var N = ni(); var D = ni(); // x^2 + y^2 + z^2 = W^2 + D // x^2 + y^2 = W^2 - z^2 + D var hist1 = new int[2 * (N + 1) * (N + 1) + 1]; var hist2 = new int[2 * (N + 1) * (N + 1) + 1]; for (int i = 1; i <= N && i * i <= hist1.Length; i++) { for (int j = 1; j <= N; j++) { if (i * i + j * j <= hist1.Length) { hist1[i * i + j * j]++; } else { break; } } for (int j = 1; j <= N; j++) { var v = i * i - j * j + D; if (0 <= v && v < hist2.Length) { hist2[v]++; } } } long ans = 0; for (int i = 0; i < hist2.Length; i++) { ans += 1L * hist1[i] * hist2[i]; } cout.WriteLine(ans); } } // PREWRITEN CODE BEGINS FROM HERE partial class Solver : Scanner { public static void Main(string[] args) { new Solver(Console.In, Console.Out).Run(); } TextReader cin; TextWriter cout; public Solver(TextReader reader, TextWriter writer) : base(reader) { this.cin = reader; this.cout = writer; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } public int ni() { return NextInt(); } public int[] ni(int n) { return NextIntArray(n); } public long nl() { return NextLong(); } public long[] nl(int n) { return NextLongArray(n); } public double nd() { return NextDouble(); } public string ns() { return Next(); } public string[] ns(int n) { return NextArray(n); } } public class Scanner { private TextReader Reader; private Queue<String> TokenQueue = new Queue<string>(); private CultureInfo ci = CultureInfo.InvariantCulture; public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { this.Reader = reader; } public int NextInt() { return Int32.Parse(Next(), ci); } public long NextLong() { return Int64.Parse(Next(), ci); } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { var array = new string[size]; for (int i = 0; i < size; i++) array[i] = Next(); return array; } public int[] NextIntArray(int size) { var array = new int[size]; for (int i = 0; i < size; i++) array[i] = NextInt(); return array; } public long[] NextLongArray(int size) { var array = new long[size]; for (int i = 0; i < size; i++) array[i] = NextLong(); return array; } public String Next() { if (TokenQueue.Count == 0) { if (!StockTokens()) throw new InvalidOperationException(); } return TokenQueue.Dequeue(); } public bool HasNext() { if (TokenQueue.Count > 0) return true; return StockTokens(); } private bool StockTokens() { while (true) { var line = Reader.ReadLine(); if (line == null) return false; var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries); if (tokens.Length == 0) continue; foreach (var token in tokens) TokenQueue.Enqueue(token); return true; } } }