結果

問題 No.1137 Circles
ユーザー neko_the_shadowneko_the_shadow
提出日時 2020-09-04 13:17:34
言語 Java21
(openjdk 21)
結果
AC  
実行時間 988 ms / 2,000 ms
コード長 5,025 bytes
コンパイル時間 3,699 ms
コンパイル使用メモリ 86,344 KB
実行使用メモリ 84,844 KB
最終ジャッジ日時 2024-05-04 02:11:56
合計ジャッジ時間 20,274 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 77 ms
38,296 KB
testcase_01 AC 903 ms
83,516 KB
testcase_02 AC 433 ms
67,112 KB
testcase_03 AC 789 ms
76,976 KB
testcase_04 AC 891 ms
80,132 KB
testcase_05 AC 529 ms
72,536 KB
testcase_06 AC 931 ms
74,444 KB
testcase_07 AC 658 ms
74,728 KB
testcase_08 AC 946 ms
73,812 KB
testcase_09 AC 619 ms
72,332 KB
testcase_10 AC 672 ms
74,696 KB
testcase_11 AC 718 ms
73,888 KB
testcase_12 AC 945 ms
84,844 KB
testcase_13 AC 657 ms
73,424 KB
testcase_14 AC 988 ms
77,216 KB
testcase_15 AC 639 ms
71,620 KB
testcase_16 AC 749 ms
74,012 KB
testcase_17 AC 460 ms
69,668 KB
testcase_18 AC 866 ms
75,152 KB
testcase_19 AC 628 ms
74,408 KB
testcase_20 AC 589 ms
74,104 KB
testcase_21 AC 76 ms
38,140 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package _1137;
import java.io.BufferedReader;
import java.io.EOFException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.lang.reflect.Array;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.Map;
import java.util.Objects;
import java.util.regex.Pattern;
import java.util.stream.Collectors;

public class Main {
    public void exec() {
        int n = stdin.nextInt();
        int[] x = new int[n];
        int[] r = new int[n];
        for (int i = 0; i < n; i++) {
            x[i] = stdin.nextInt();
            r[i] = stdin.nextInt();
        }

        Map<Integer, Integer> imos = new HashMap<>();
        for (int i = 0; i < n; i++) {
            imos.compute(x[i]-r[i], (k, v) -> v == null ? 1 : v+1);
            imos.compute(x[i]+r[i], (k, v) -> v == null ? -1 : v-1);
        }

        int min = Collections.min(imos.keySet());
        int max = Collections.max(imos.keySet());
        for (int i = min; i <=max; i++) {
            if (imos.containsKey(i+1)) {
                imos.put(i+1, imos.get(i)+imos.get(i+1));
            } else {
                imos.put(i+1, imos.get(i));
            }
        }

        stdout.println(Collections.max(imos.values()));
    }

    private static final Stdin stdin = new Stdin();
    private static final Stdout stdout = new Stdout();

    public static void main(String[] args) {
        try {
            new Main().exec();
        } finally {
            stdout.flush();
        }
    }

    public static class Stdin {
        private BufferedReader stdin;
        private Deque<String> tokens;
        private Pattern delim;

        public Stdin() {
            stdin = new BufferedReader(new InputStreamReader(System.in));
            tokens = new ArrayDeque<>();
            delim = Pattern.compile(" ");
        }

        public String nextString() {
            try {
                if (tokens.isEmpty()) {
                    String line = stdin.readLine();
                    if (line == null) {
                        throw new UncheckedIOException(new EOFException());
                    }
                    delim.splitAsStream(line).forEach(tokens::addLast);
                }
                return tokens.pollFirst();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }

        public int nextInt() {
            return Integer.parseInt(nextString());
        }

        public double nextDouble() {
            return Double.parseDouble(nextString());
        }

        public long nextLong() {
            return Long.parseLong(nextString());
        }

        public String[] nextStringArray(int n) {
            String[] a = new String[n];
            for (int i = 0; i < n; i++) a[i] = nextString();
            return a;
        }

        public int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

        public double[] nextDoubleArray(int n) {
            double[] a = new double[n];
            for (int i = 0; i < n; i++) a[i] = nextDouble();
            return a;
        }

        public long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) a[i] = nextLong();
            return a;
        }
    }

    public static class Stdout {
        private PrintWriter stdout;

        public Stdout() {
            stdout =  new PrintWriter(System.out, false);
        }

        public void printf(String format, Object ... args) {
            String line = String.format(format, args);
            if (line.endsWith(System.lineSeparator())) {
                stdout.print(line);
            } else {
                stdout.println(line);
            }
        }

        public void println(Object ... objs) {
            String line = Arrays.stream(objs).map(Objects::toString).collect(Collectors.joining(" "));
            stdout.println(line);
        }

        public void printDebug(Object ... objs) {
            String line = Arrays.stream(objs).map(this::deepToString).collect(Collectors.joining(" "));
            stdout.printf("DEBUG: %s%n", line);
            stdout.flush();
        }

        private String deepToString(Object o) {
            if (o == null) {
                return "null";
            }

            // 配列の場合
            if (o.getClass().isArray()) {
                int len = Array.getLength(o);
                String[] tokens = new String[len];
                for (int i = 0; i < len; i++) {
                    tokens[i] = deepToString(Array.get(o, i));
                }
                return "{" + String.join(",", tokens) + "}";
            }

            return Objects.toString(o);
        }

        private void flush() {
            stdout.flush();
        }
    }
}
0