結果

問題 No.800 四平方定理
ユーザー uwiuwi
提出日時 2019-03-18 01:08:45
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,520 ms / 2,000 ms
コード長 3,759 bytes
コンパイル時間 4,004 ms
コンパイル使用メモリ 86,292 KB
実行使用メモリ 72,332 KB
最終ジャッジ日時 2024-07-08 07:56:06
合計ジャッジ時間 25,542 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 77 ms
38,140 KB
testcase_01 AC 93 ms
39,040 KB
testcase_02 AC 81 ms
38,500 KB
testcase_03 AC 94 ms
39,056 KB
testcase_04 AC 88 ms
38,840 KB
testcase_05 AC 105 ms
38,996 KB
testcase_06 AC 104 ms
39,188 KB
testcase_07 AC 96 ms
39,160 KB
testcase_08 AC 91 ms
39,380 KB
testcase_09 AC 101 ms
39,096 KB
testcase_10 AC 678 ms
56,176 KB
testcase_11 AC 773 ms
58,296 KB
testcase_12 AC 912 ms
57,712 KB
testcase_13 AC 669 ms
56,872 KB
testcase_14 AC 678 ms
58,276 KB
testcase_15 AC 802 ms
58,232 KB
testcase_16 AC 721 ms
58,508 KB
testcase_17 AC 686 ms
58,596 KB
testcase_18 AC 895 ms
58,332 KB
testcase_19 AC 884 ms
58,392 KB
testcase_20 AC 49 ms
36,836 KB
testcase_21 AC 49 ms
36,976 KB
testcase_22 AC 894 ms
58,452 KB
testcase_23 AC 1,520 ms
72,272 KB
testcase_24 AC 1,181 ms
72,268 KB
testcase_25 AC 1,497 ms
72,124 KB
testcase_26 AC 50 ms
37,116 KB
testcase_27 AC 50 ms
36,824 KB
testcase_28 AC 1,163 ms
72,080 KB
testcase_29 AC 1,427 ms
72,192 KB
testcase_30 AC 1,193 ms
72,228 KB
testcase_31 AC 1,116 ms
69,900 KB
testcase_32 AC 1,334 ms
72,332 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190317;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

// 7
public class B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), d = ni();
		int[] f = new int[n*n];
		int p = 0;
		for(int i = 1;i <= n;i++){
			for(int j = 1;j <= n;j++){
				f[p++] = i*i+j*j;
			}
		}
		Arrays.sort(f);
		
		long ans = 0;
		for(int i = 1;i <= n;i++){
			for(int j = 1;j <= n;j++){
				int g = i*i-j*j;
				ans += lowerBound(f, d+g+1) - lowerBound(f, d+g);
			}
		}
		out.println(ans);
	}
	
	public static int lowerBound(int[] a, int v){ return lowerBound(a, 0, a.length, v); }
	public static int lowerBound(int[] a, int l, int r, int v)
	{
		if(l > r || l < 0 || r > a.length)throw new IllegalArgumentException();
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new B().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0