結果

問題 No.817 Coin donation
ユーザー kusomushikusomushi
提出日時 2019-07-09 21:52:16
言語 Java21
(openjdk 21)
結果
AC  
実行時間 773 ms / 2,000 ms
コード長 5,451 bytes
コンパイル時間 2,352 ms
コンパイル使用メモリ 82,124 KB
実行使用メモリ 53,644 KB
最終ジャッジ日時 2024-04-20 19:46:58
合計ジャッジ時間 7,796 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
37,980 KB
testcase_01 AC 64 ms
38,124 KB
testcase_02 AC 73 ms
38,220 KB
testcase_03 AC 73 ms
38,232 KB
testcase_04 AC 69 ms
38,296 KB
testcase_05 AC 147 ms
40,916 KB
testcase_06 AC 229 ms
45,828 KB
testcase_07 AC 242 ms
45,900 KB
testcase_08 AC 509 ms
53,292 KB
testcase_09 AC 256 ms
46,316 KB
testcase_10 AC 656 ms
53,380 KB
testcase_11 AC 759 ms
53,540 KB
testcase_12 AC 773 ms
53,644 KB
testcase_13 AC 58 ms
37,256 KB
testcase_14 AC 63 ms
37,768 KB
testcase_15 AC 59 ms
37,620 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringJoiner;
import java.util.StringTokenizer;

public class Main {

    static int N, K;
    static int[] A, B;

    public static void main(String[] args) {
        FastScanner sc = new FastScanner(System.in);
        N = sc.nextInt();
        K = sc.nextInt();
        A = new int[N];
        B = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            B[i] = sc.nextInt();
        }

        System.out.println(solve());
    }

    static int solve() {
        int[][] E = new int[N*2][2];
        for (int i = 0; i < N; i++) {
            E[i*2][0] = A[i];
            E[i*2][1] = 0;
            E[i*2+1][0] = B[i]+1;
            E[i*2+1][1] = 1;
        }
        Arrays.sort(E, Comparator.<int[]>comparingInt(e -> e[0]).thenComparingInt(e -> e[1]));

        int r = K;
        int d = 0;
        int prev = 0;
        for (int i = 0; i < N * 2; i++) {
            int[] ev = E[i];

            int a = ev[0];
            if( (a - prev) * d >= r ) {
                return prev + ((r+d-1) / d) - 1;

            } else {
                if( ev[1] == 0 ) {
                    r -= (a - prev) * d;
                    d++;
                    prev = a;
                } else {
                    r -= (a - prev) * d;
                    d--;
                    prev = a;
                }
            }
        }
        return -1;
    }

    @SuppressWarnings("unused")
    static class FastScanner {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

        FastScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
            tokenizer = null;
        }

        String next() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        String nextLine() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    return reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken("\n");
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

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

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

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

    static void writeLines(int[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int a : as) pw.println(a);
        pw.flush();
    }

    static void writeLines(long[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (long a : as) pw.println(a);
        pw.flush();
    }

    static void writeSingleLine(int[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int i = 0; i < as.length; i++) {
            if (i != 0) pw.print(" ");
            pw.print(as[i]);
        }
        pw.println();
        pw.flush();
    }

    static int max(int... as) {
        int max = Integer.MIN_VALUE;
        for (int a : as) max = Math.max(a, max);
        return max;
    }

    static int min(int... as) {
        int min = Integer.MAX_VALUE;
        for (int a : as) min = Math.min(a, min);
        return min;
    }

    static void debug(Object... args) {
        StringJoiner j = new StringJoiner(" ");
        for (Object arg : args) {
            if (arg == null) j.add("null");
            else if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));
            else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));
            else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));
            else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));
            else j.add(arg.toString());
        }
        System.err.println(j.toString());
    }

    static void printSingleLine(int[] array) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int i = 0; i < array.length; i++) {
            if (i != 0) pw.print(" ");
            pw.print(array[i]);
        }
        pw.println();
        pw.flush();
    }

    static int lowerBound(int[] array, int value) {
        int lo = 0, hi = array.length, mid;
        while (lo < hi) {
            mid = (hi + lo) / 2;
            if (array[mid] < value) lo = mid + 1;
            else hi = mid;
        }
        return lo;
    }

    static int upperBound(int[] array, int value) {
        int lo = 0, hi = array.length, mid;
        while (lo < hi) {
            mid = (hi + lo) / 2;
            if (array[mid] <= value) lo = mid + 1;
            else hi = mid;
        }
        return lo;
    }
}
0