結果

問題 No.800 四平方定理
ユーザー OlandOland
提出日時 2019-03-17 22:00:44
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,058 bytes
コンパイル時間 2,990 ms
コンパイル使用メモリ 90,204 KB
実行使用メモリ 142,368 KB
最終ジャッジ日時 2024-07-07 22:47:52
合計ジャッジ時間 8,359 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 143 ms
46,920 KB
testcase_01 AC 186 ms
43,536 KB
testcase_02 AC 165 ms
42,600 KB
testcase_03 AC 168 ms
43,360 KB
testcase_04 AC 155 ms
42,324 KB
testcase_05 AC 163 ms
42,696 KB
testcase_06 AC 197 ms
46,684 KB
testcase_07 AC 175 ms
43,188 KB
testcase_08 AC 179 ms
46,552 KB
testcase_09 AC 186 ms
43,692 KB
testcase_10 TLE -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
testcase_26 -- -
testcase_27 -- -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
権限があれば一括ダウンロードができます

ソースコード

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();
		ArrayList<Long> list = new ArrayList<>();
		long ans = 0;
		
		for(long z = 1; z <= N; z++){
			for(long w = 1; w <= N; w++){
				list.add(w * w - z * z);
			}
		}
		Collections.sort(list);
		
		for(long x = 1; x <= N; x++){
			for(long y = 1; y <= N; y++){
				long xxyyD = x * x + y * y - D;
				int indexUpper = upperBound(list, xxyyD);
				int indexLower = lowerBound(list, xxyyD);
				
				if(indexLower < list.size() && list.get(indexLower) == xxyyD){
					ans += indexUpper - indexLower + 1;
				}
			}
		}
		System.out.println(ans);
 	}
	
	public int upperBound(ArrayList<Long> a, long key){
		int ok = -1;
		int ng = a.size();
		
		while(Math.abs(ok - ng) > 1){
			int mid = (ok + ng) / 2;
			if(a.get(mid) <= key) ok = mid;
			else ng = mid;
		}
		
		return ok;
	}
	
	public int lowerBound(ArrayList<Long> a, long key){
		int ng = -1;
		int ok = a.size();
		
		while(Math.abs(ok - ng) > 1){
			int mid = (ok + ng) / 2;
			if(a.get(mid) >= key) ok = mid;
			else ng = mid;
		}
		
		return ok;
	}
	
	/* 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