#346382 (Java21) No.800 四平方定理

提出ソース

結果

問題	No.800 四平方定理
ユーザー	touchan4692
提出日時	2019-05-12 14:41:38
言語	Java21 (openjdk 21)
結果	AC
実行時間	183 ms / 2,000 ms
コード長	6,191 bytes
コンパイル時間	2,327 ms
コンパイル使用メモリ	84,692 KB
実行使用メモリ	102,488 KB
最終ジャッジ日時	2024-07-04 03:33:13
合計ジャッジ時間	7,326 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	78 ms 100,840 KB
testcase_01	AC	83 ms 101,668 KB
testcase_02	AC	83 ms 101,732 KB
testcase_03	AC	83 ms 101,728 KB
testcase_04	AC	79 ms 100,664 KB
testcase_05	AC	81 ms 101,760 KB
testcase_06	AC	82 ms 101,448 KB
testcase_07	AC	80 ms 101,612 KB
testcase_08	AC	82 ms 101,728 KB
testcase_09	AC	83 ms 101,616 KB
testcase_10	AC	135 ms 102,204 KB
testcase_11	AC	127 ms 101,960 KB
testcase_12	AC	129 ms 102,436 KB
testcase_13	AC	120 ms 102,488 KB
testcase_14	AC	129 ms 102,052 KB
testcase_15	AC	126 ms 102,328 KB
testcase_16	AC	129 ms 102,272 KB
testcase_17	AC	131 ms 102,472 KB
testcase_18	AC	135 ms 102,200 KB
testcase_19	AC	131 ms 102,268 KB
testcase_20	AC	75 ms 100,964 KB
testcase_21	AC	77 ms 100,972 KB
testcase_22	AC	136 ms 102,400 KB
testcase_23	AC	182 ms 102,308 KB
testcase_24	AC	183 ms 102,488 KB
testcase_25	AC	183 ms 102,488 KB
testcase_26	AC	73 ms 100,992 KB
testcase_27	AC	74 ms 100,552 KB
testcase_28	AC	169 ms 102,488 KB
testcase_29	AC	174 ms 102,488 KB
testcase_30	AC	168 ms 102,472 KB
testcase_31	AC	156 ms 102,244 KB
testcase_32	AC	175 ms 102,252 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.text.DecimalFormat;
import java.util.AbstractMap;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;				

public class Main {
	
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyInput in = new MyInput(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        
        Solver solver = new Solver();
        solver.solve(1, in, out);
        
        out.close();
    }
    
    // ======================================================================
    
    static class Solver {
    	long[] t = new long[2000*2000*2+1];
    	public void solve(int testNumber, MyInput in, PrintWriter out) {
    		long N = in.nextLong();
    		long D = in.nextLong();
    		long ans = 0, wk;
//    		out.println("N * N = " + (N*N));
    		for(long z=1; z <= N; z++) {
        		for(long w=1; w <= N; w++) {
        			wk = z*z - w*w + N*N;
        			t[(int)wk]++;
//        			out.println("z = " + z + "  w = " + w + "  t[" + wk + "] = " + t[(int)wk]);
        		}
    		}
    		for(long x=1; x <= N; x++) {
        		for(long y=1; y <= N; y++) {
        			wk = x*x + y*y - D + N*N;
        			if(wk >= 0 && wk <= 2*N*N) {
        				ans += t[(int)wk];
//            			out.println("x = " + x + "  y = " + y 
//            					+ "  t[" + wk + "] = " + t[(int)wk] + "  ans = " + ans);
        			}
        		}
    		}
    		out.println(ans);
    	}
    }
    static class PPP {
    	public int key, val;
    	public PPP(int key, int val) {
    		this.key = key;
    		this.val = val;
    	}
		public int getKey() {
			return key;
		}
		public void setKey(int key) {
			this.key = key;
		}
		public int getVal() {
			return val;
		}
		public void setVal(int val) {
			this.val = val;
		}
    }
    // ======================================================================
    static class Pair<K, V> extends AbstractMap.SimpleEntry<K, V> {
        /** serialVersionUID. */
        private static final long serialVersionUID = 6411527075103472113L;

        public Pair(final K key, final V value) {
            super(key, value);
        }
     }    
    static class MyInput {
        private final BufferedReader in;
        private static int pos;
        private static int readLen;
        private static final char[] buffer = new char[1024 * 8];
        private static char[] str = new char[500 * 8 * 2];
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];
        private static boolean[] isLineSep = new boolean[256];
 
        static {
            for (int i = 0; i < 10; i++) {
                isDigit['0' + i] = true;
            }
            isDigit['-'] = true;
            isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
            isLineSep['\r'] = isLineSep['\n'] = true;
        }
 
        public MyInput(InputStream is) {
            in = new BufferedReader(new InputStreamReader(is));
        }
 
        public int read() {
            if (pos >= readLen) {
                pos = 0;
                try {
                    readLen = in.read(buffer);
                } catch (IOException e) {
                    throw new RuntimeException();
                }
                if (readLen <= 0) {
                    throw new MyInput.EndOfFileRuntimeException();
                }
            }
            return buffer[pos++];
        }
 
        public int nextInt() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            int ret = 0;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
        public long nextLong() {
            int len = 0;
            str[len++] = nextChar();
            len = reads(len, isSpace);
            int i = 0;
            long ret = 0L;
            if (str[0] == '-') {
                i = 1;
            }
            for (; i < len; i++) ret = ret * 10 + str[i] - '0';
            if (str[0] == '-') {
                ret = -ret;
            }
            return ret;
        }
 
       public String nextString() {
        	String ret = new String(nextDChar()).trim();
            return ret;
        }
 
        public char[] nextDChar() {
            int len = 0;
            len = reads(len, isSpace);
            char[] ret = new char[len + 1];
            for (int i=0; i < len; i++)		ret[i] = str[i];
            ret[len] = 0x00;
            return ret;
        }
 
        public char nextChar() {
            while (true) {
                final int c = read();
                if (!isSpace[c]) {
                    return (char) c;
                }
            }
        }
 
        int reads(int len, boolean[] accept) {
            try {
                while (true) {
                    final int c = read();
                    if (accept[c]) {
                        break;
                    }
                    if (str.length == len) {
                        char[] rep = new char[str.length * 3 / 2];
                        System.arraycopy(str, 0, rep, 0, str.length);
                        str = rep;
                    }
                    str[len++] = (char) c;
                }
            } catch (MyInput.EndOfFileRuntimeException e) {
            }
            return len;
        }
 
        static class EndOfFileRuntimeException extends RuntimeException {
        }
    }
}

yukicoder

結果

テストケース

ソースコード