結果
問題 | No.728 ギブ and テイク |
ユーザー | hiromi_ayase |
提出日時 | 2018-08-25 06:52:59 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,546 ms / 3,000 ms |
コード長 | 3,436 bytes |
コンパイル時間 | 2,394 ms |
コンパイル使用メモリ | 89,568 KB |
実行使用メモリ | 104,736 KB |
最終ジャッジ日時 | 2023-09-06 14:58:27 |
合計ジャッジ時間 | 20,693 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 69 ms
51,204 KB |
testcase_01 | AC | 69 ms
50,852 KB |
testcase_02 | AC | 71 ms
50,796 KB |
testcase_03 | AC | 69 ms
50,900 KB |
testcase_04 | AC | 70 ms
50,952 KB |
testcase_05 | AC | 70 ms
51,096 KB |
testcase_06 | AC | 70 ms
51,016 KB |
testcase_07 | AC | 70 ms
50,940 KB |
testcase_08 | AC | 80 ms
51,872 KB |
testcase_09 | AC | 71 ms
50,900 KB |
testcase_10 | AC | 75 ms
50,888 KB |
testcase_11 | AC | 86 ms
49,652 KB |
testcase_12 | AC | 91 ms
51,528 KB |
testcase_13 | AC | 280 ms
59,516 KB |
testcase_14 | AC | 351 ms
61,240 KB |
testcase_15 | AC | 236 ms
57,280 KB |
testcase_16 | AC | 335 ms
59,468 KB |
testcase_17 | AC | 345 ms
59,188 KB |
testcase_18 | AC | 1,408 ms
78,916 KB |
testcase_19 | AC | 1,430 ms
88,892 KB |
testcase_20 | AC | 1,493 ms
97,900 KB |
testcase_21 | AC | 1,455 ms
90,996 KB |
testcase_22 | AC | 682 ms
70,500 KB |
testcase_23 | AC | 537 ms
66,240 KB |
testcase_24 | AC | 1,215 ms
77,496 KB |
testcase_25 | AC | 1,146 ms
77,484 KB |
testcase_26 | AC | 667 ms
71,876 KB |
testcase_27 | AC | 1,546 ms
104,736 KB |
testcase_28 | AC | 1,100 ms
104,632 KB |
testcase_29 | AC | 70 ms
50,868 KB |
testcase_30 | AC | 69 ms
51,136 KB |
testcase_31 | AC | 69 ms
50,856 KB |
testcase_32 | AC | 69 ms
51,332 KB |
ソースコード
import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int[] a = na(n); int[][] r = ntable(n, 2); int[] ft = new int[n + 1]; int[][] b = new int[n * 2][]; for (int i = 0; i < n; i ++) { b[i * 2 + 0] = new int[] {a[i], i, 0}; b[i * 2 + 1] = new int[] {a[i] - r[i][0], i, 1}; } Arrays.sort(b, (o1, o2) -> o1[0] == o2[0] ? o2[2] - o1[2] : o1[0] - o2[0]); long ret = 0; for (int i = 0; i < n * 2; i ++) { int j = b[i][1]; if (b[i][2] == 1) { addFenwick(ft, j, 1); } else { int k = Arrays.binarySearch(a, b[i][0] + r[j][1]); if (k < 0) k = -k - 2; ret += sumFenwick(ft, k) - sumFenwick(ft, j); } } System.out.println(ret); } public static int sumFenwick(int[] ft, int i) { int sum = 0; for(i++;i > 0;i -= i&-i)sum += ft[i]; return sum; } public static void addFenwick(int[] ft, int i, int v) { if(v == 0 || i < 0)return; int n = ft.length; for(i++;i < n;i += i&-i)ft[i] += v; } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }