結果
問題 | No.723 2つの数の和 |
ユーザー | tutuz |
提出日時 | 2018-09-03 00:23:17 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 298 ms / 2,000 ms |
コード長 | 3,563 bytes |
コンパイル時間 | 2,215 ms |
コンパイル使用メモリ | 78,392 KB |
実行使用メモリ | 57,032 KB |
最終ジャッジ日時 | 2024-04-15 00:38:06 |
合計ジャッジ時間 | 8,575 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
50,680 KB |
testcase_01 | AC | 56 ms
50,708 KB |
testcase_02 | AC | 57 ms
50,556 KB |
testcase_03 | AC | 260 ms
56,500 KB |
testcase_04 | AC | 289 ms
57,032 KB |
testcase_05 | AC | 285 ms
56,672 KB |
testcase_06 | AC | 278 ms
56,872 KB |
testcase_07 | AC | 207 ms
56,528 KB |
testcase_08 | AC | 210 ms
55,896 KB |
testcase_09 | AC | 298 ms
56,880 KB |
testcase_10 | AC | 205 ms
55,580 KB |
testcase_11 | AC | 120 ms
52,684 KB |
testcase_12 | AC | 226 ms
56,624 KB |
testcase_13 | AC | 280 ms
56,856 KB |
testcase_14 | AC | 169 ms
55,208 KB |
testcase_15 | AC | 200 ms
55,664 KB |
testcase_16 | AC | 238 ms
56,496 KB |
testcase_17 | AC | 262 ms
56,808 KB |
testcase_18 | AC | 198 ms
56,296 KB |
testcase_19 | AC | 231 ms
56,676 KB |
testcase_20 | AC | 57 ms
50,452 KB |
testcase_21 | AC | 57 ms
50,468 KB |
testcase_22 | AC | 58 ms
50,664 KB |
testcase_23 | AC | 295 ms
56,652 KB |
testcase_24 | AC | 188 ms
54,968 KB |
ソースコード
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.util.Arrays; import java.util.InputMismatchException; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskX solver = new TaskX(); solver.solve(1, in, out); out.close(); } static int INF = 1 << 30; static long LINF = 1L << 55; static int MOD = 1000000007; static int[] mh4 = { 0, -1, 1, 0 }; static int[] mw4 = { -1, 0, 0, 1 }; static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 }; static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 }; static class TaskX { public void solve(int testNumber, InputReader in, PrintWriter out) { int n = in.nextInt(), x = in.nextInt(); int[] a = in.nextIntArray(n); Arrays.sort(a); long ans = 0; for (int i = 0; i < n; i++) { int l = lowerBound(a, x-a[i]); int r = upperBound(a, x-a[i]); ans += r - l; } out.println(ans); } public static int lowerBound(int[] a, int obj) { int l = 0, r = a.length - 1; while (r - l >= 0) { int c = (l + r) / 2; if (obj <= a[c]) { r = c - 1; } else { l = c + 1; } } return l; } public static int upperBound(int[] a, int obj) { int l = 0, r = a.length - 1; while (r - l >= 0) { int c = (l + r) / 2; if (a[c] <= obj) { l = c + 1; } else { r = c - 1; } } return l; } } static class InputReader { BufferedReader in; StringTokenizer tok; public String nextString() { while (!tok.hasMoreTokens()) { try { tok = new StringTokenizer(in.readLine(), " "); } catch (IOException e) { throw new InputMismatchException(); } } return tok.nextToken(); } public int nextInt() { return Integer.parseInt(nextString()); } public long nextLong() { return Long.parseLong(nextString()); } public double nextDouble() { return Double.parseDouble(nextString()); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public InputReader(InputStream inputStream) { in = new BufferedReader(new InputStreamReader(inputStream)); tok = new StringTokenizer(""); } } static long max(long... n) { long ret = n[0]; for (int i = 0; i < n.length; i++) { ret = Math.max(ret, n[i]); } return ret; } static int max(int... n) { int ret = n[0]; for (int i = 0; i < n.length; i++) { ret = Math.max(ret, n[i]); } return ret; } static long min(long... n) { long ret = n[0]; for (int i = 0; i < n.length; i++) { ret = Math.min(ret, n[i]); } return ret; } static int min(int... n) { int ret = n[0]; for (int i = 0; i < n.length; i++) { ret = Math.min(ret, n[i]); } return ret; } }