結果

問題 No.723 2つの数の和
ユーザー GrenacheGrenache
提出日時 2018-09-17 09:29:02
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,290 bytes
コンパイル時間 3,170 ms
コンパイル使用メモリ 77,812 KB
実行使用メモリ 52,800 KB
最終ジャッジ日時 2024-07-18 07:35:13
合計ジャッジ時間 6,486 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
37,616 KB
testcase_01 AC 48 ms
37,408 KB
testcase_02 AC 50 ms
37,656 KB
testcase_03 AC 121 ms
39,928 KB
testcase_04 AC 132 ms
40,024 KB
testcase_05 AC 124 ms
40,004 KB
testcase_06 AC 128 ms
40,040 KB
testcase_07 AC 90 ms
40,240 KB
testcase_08 AC 104 ms
40,008 KB
testcase_09 AC 126 ms
39,968 KB
testcase_10 AC 102 ms
39,844 KB
testcase_11 AC 84 ms
38,908 KB
testcase_12 AC 109 ms
39,716 KB
testcase_13 AC 119 ms
40,284 KB
testcase_14 AC 95 ms
39,584 KB
testcase_15 AC 107 ms
40,088 KB
testcase_16 AC 120 ms
40,004 KB
testcase_17 AC 109 ms
40,132 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 51 ms
37,468 KB
testcase_21 AC 48 ms
37,544 KB
testcase_22 AC 48 ms
37,400 KB
testcase_23 AC 119 ms
39,900 KB
testcase_24 AC 90 ms
40,000 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