結果

問題 No.723 2つの数の和
ユーザー GrenacheGrenache
提出日時 2018-09-17 09:29:02
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,290 bytes
コンパイル時間 3,585 ms
コンパイル使用メモリ 74,732 KB
実行使用メモリ 53,404 KB
最終ジャッジ日時 2023-09-25 09:16:48
合計ジャッジ時間 7,373 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
49,176 KB
testcase_01 AC 45 ms
49,800 KB
testcase_02 AC 46 ms
49,168 KB
testcase_03 AC 112 ms
52,952 KB
testcase_04 AC 130 ms
53,100 KB
testcase_05 AC 125 ms
52,856 KB
testcase_06 AC 131 ms
52,852 KB
testcase_07 AC 105 ms
52,944 KB
testcase_08 AC 107 ms
53,016 KB
testcase_09 AC 131 ms
53,192 KB
testcase_10 AC 104 ms
52,964 KB
testcase_11 AC 87 ms
51,716 KB
testcase_12 AC 102 ms
52,124 KB
testcase_13 AC 129 ms
52,888 KB
testcase_14 AC 89 ms
53,128 KB
testcase_15 AC 107 ms
52,844 KB
testcase_16 AC 116 ms
53,112 KB
testcase_17 AC 124 ms
52,972 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 47 ms
49,284 KB
testcase_21 AC 45 ms
49,436 KB
testcase_22 AC 46 ms
49,396 KB
testcase_23 AC 130 ms
53,012 KB
testcase_24 AC 97 ms
52,180 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder723 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int x = sc.nextInt();

		int[] cnt = new int[100_000 + 1];
		for (int i = 0; i < n; i++) {
			int a = sc.nextInt();
			cnt[a]++;
		}

		int ans = 0;
		for (int i = 0; i <= 100_000; i++) {
			if (x - i >= 0 && x - i <= 100_000) {
				ans += cnt[i] * cnt[x - i];
			}
		}

		pr.println(ans);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(INPUT == null ? System.in : new ByteArrayInputStream(INPUT.getBytes()));
		pr = new Printer(System.out);

		solve();

//		pr.close();
		pr.flush();
//		sc.close();
	}

	static String INPUT = null;

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(OutputStream out) {
			super(out);
		}
	}
}
0