結果

問題 No.800 四平方定理
ユーザー OlandOland
提出日時 2019-03-20 12:13:24
言語 Java21
(openjdk 21)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,513 bytes
コンパイル時間 2,716 ms
コンパイル使用メモリ 78,280 KB
実行使用メモリ 161,172 KB
最終ジャッジ日時 2023-10-18 22:03:20
合計ジャッジ時間 40,636 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 118 ms
56,836 KB
testcase_01 AC 147 ms
57,956 KB
testcase_02 AC 122 ms
57,508 KB
testcase_03 AC 129 ms
58,064 KB
testcase_04 AC 123 ms
57,476 KB
testcase_05 AC 117 ms
57,456 KB
testcase_06 AC 148 ms
57,788 KB
testcase_07 AC 127 ms
57,964 KB
testcase_08 AC 149 ms
57,956 KB
testcase_09 AC 144 ms
57,900 KB
testcase_10 AC 1,252 ms
104,184 KB
testcase_11 AC 1,328 ms
114,504 KB
testcase_12 AC 1,303 ms
116,812 KB
testcase_13 AC 1,285 ms
114,288 KB
testcase_14 AC 1,334 ms
114,644 KB
testcase_15 AC 1,331 ms
116,792 KB
testcase_16 AC 1,344 ms
114,664 KB
testcase_17 AC 1,341 ms
114,988 KB
testcase_18 AC 1,342 ms
114,844 KB
testcase_19 AC 1,308 ms
115,136 KB
testcase_20 AC 54 ms
53,232 KB
testcase_21 AC 53 ms
53,224 KB
testcase_22 AC 1,381 ms
115,128 KB
testcase_23 TLE -
testcase_24 TLE -
testcase_25 TLE -
testcase_26 AC 54 ms
53,232 KB
testcase_27 AC 52 ms
51,188 KB
testcase_28 TLE -
testcase_29 TLE -
testcase_30 TLE -
testcase_31 TLE -
testcase_32 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.*;
import java.util.*;
import java.util.Map.Entry;

public class Main {
	
	final boolean isDebug = false;
	String fileName = "input.txt";
	FastScanner sc;
	//PrintWriter out;
	final int MOD = (int)1e9+7;
	final int INF = Integer.MAX_VALUE / 2;
		
	/* solve */
	void solve() throws Exception{
		int N = sc.nextInt();
		int D = sc.nextInt();
		
		HashMap<Integer, Integer> map = new HashMap<>();
		for(int x = 1; x <= N; x++){
			for(int y = 1; y <= N; y++){
				int k = x * x + y * y;
				Integer v = map.get(k);
				if(v == null) v = 1;
				else v++;
				map.put(k, v);
			}
		}
		
		long ans = 0;
		for(int z = 1; z <= N; z++){
			for(int w = 1; w <= N; w++){
				int k = D + w * w - z * z;
				Integer v = map.get(k);
				if(v == null) v = 0;
				ans += v;
			}
		}
		
		System.out.println(ans);
 	}
	
	/* end solve */
	
	/* main */
	public static void main(String[] args) throws Exception {
		new Main().m();
	}
	
	void m() throws Exception {
		long S = System.currentTimeMillis();
		sc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);
		//out = new PrintWriter(System.out);
		solve();
		//out.flush();
		long G = System.currentTimeMillis();
		if(isDebug){
			System.out.println("---Debug---");
			System.out.printf("%8d ms", (G-S));
		}
	}
	/* end main */
}
/* end Main */

class FastScanner {
    private InputStream in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public FastScanner(InputStream in) {
		this.in = in;
	}
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() {
    	if (hasNextByte()) return buffer[ptr++];
    	else return -1;
    }
    private static boolean isPrintableChar(int c){
    	return 33 <= c && c <= 126;
    }
    public boolean hasNext() {
    	while(hasNextByte() && !isPrintableChar(buffer[ptr]))
    		ptr++; return hasNextByte();
    }
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() {
    	return Double.parseDouble(next());
    }
}
0