제출 #1119550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1119550		johu	Job Scheduling (CEOI12_jobs)	Java	25 / 100	1060 ms	49088 KiB

jobs

import java.io.*;
import java.util.*;
import java.util.stream.Collectors;

public class jobs {
    public static void main(String[] args) throws IOException {
        var reader = new FastInputReader(System.in);

        var n = reader.nextInt(); // Number of days
        var d = reader.nextInt(); // Delay allowed
        var m = reader.nextInt(); // Number of events

        if (m <= 300000) {
            // Use the ArrayList-based implementation for smaller cases
            handleSmallCases(reader, n, d, m);
        } else {
            // Use the provided code for larger cases
            handleLargeCases(reader, n, d, m);
        }
    }

    private static void handleSmallCases(FastInputReader reader, int n, int d, int m) throws IOException {
        // Read input in one go using BufferedReader.lines()
        var a = new ArrayList<Pair>(m + 2);
        try (var br = new BufferedReader(new InputStreamReader(System.in))) {
            var input = Arrays.stream(br.readLine().split(" "))
                              .map(Integer::parseInt)
                              .collect(Collectors.toList());
            for (int i = 1; i <= m; i++) {
                a.add(new Pair(input.get(i - 1), i));
            }
        }
        a.add(new Pair(1000000000, 0)); // Dummy pair for boundary

        // Sort using Comparator.comparingInt for brevity
        a.sort(Comparator.comparingInt(p -> p.fr));

        var l = 0;
        var r = m;

        while (r - l > 1) {
            var mid = (l + r) / 2;
            var p = 0;

            for (int i = 1; i <= n; i++) {
                if (a.get(p).fr + d < i) {
                    break;
                }
                var cnt = 0;
                while (cnt < mid && p < m && a.get(p).fr <= i) {
                    cnt++;
                    p++;
                }
            }

            if (p >= m) {
                r = mid;
            } else {
                l = mid;
            }
        }

        System.out.println(r);
        var sb = new StringBuilder();
        var p = 0;

        for (int i = 1; i <= n; i++) {
            var cnt = 0;
            while (cnt < r && p < m && a.get(p).fr <= i) {
                sb.append(a.get(p).sc).append(" ");
                cnt++;
                p++;
            }
            sb.append("0\n");
        }

        System.out.print(sb);
    }

    private static void handleLargeCases(FastInputReader reader, int n, int d, int m) throws IOException {
        var fr = new int[m + 1];
        var sc = new int[m + 1];

        for (int i = 1; i <= m; i++) {
            fr[i] = reader.nextInt();
            sc[i] = i;
        }

        quickSort(fr, sc, 1, m);

        var l = 0;
        var r = m;

        while (r - l > 1) {
            var mid = (l + r) / 2;
            var p = 1;

            for (int i = 1; i <= n; i++) {
                if (p > m || fr[p] + d < i) break;
                var cnt = 0;
                while (cnt < mid && p <= m && fr[p] <= i) {
                    cnt++;
                    p++;
                }
            }

            if (p > m) {
                r = mid;
            } else {
                l = mid;
            }
        }

        try (var bw = new BufferedWriter(new OutputStreamWriter(System.out))) {
            bw.write(r + "\n");

            var p = 1;
            for (int i = 1; i <= n; i++) {
                var cnt = 0;
                while (cnt < r && p <= m && fr[p] <= i) {
                    bw.write(sc[p] + " ");
                    cnt++;
                    p++;
                }
                bw.write("0\n");
            }
        }
    }

    private static void quickSort(int[] fr, int[] sc, int low, int high) {
        if (low < high) {
            var pivotIndex = partition(fr, sc, low, high);
            quickSort(fr, sc, low, pivotIndex - 1);
            quickSort(fr, sc, pivotIndex + 1, high);
        }
    }

    private static int partition(int[] fr, int[] sc, int low, int high) {
        var pivot = fr[high];
        var i = low - 1;
        for (int j = low; j < high; j++) {
            if (fr[j] <= pivot) {
                i++;
                swap(fr, sc, i, j);
            }
        }
        swap(fr, sc, i + 1, high);
        return i + 1;
    }

    private static void swap(int[] fr, int[] sc, int i, int j) {
        var tempFr = fr[i];
        fr[i] = fr[j];
        fr[j] = tempFr;

        var tempSc = sc[i];
        sc[i] = sc[j];
        sc[j] = tempSc;
    }

    static class Pair implements Comparable<Pair> {
        int fr, sc;

        Pair(int fr, int sc) {
            this.fr = fr;
            this.sc = sc;
        }

        @Override
        public int compareTo(Pair other) {
            return Integer.compare(this.fr, other.fr);
        }
    }

    static class FastInputReader {
        private final DataInputStream din;
        private final byte[] buffer;
        private int bufferPointer, bytesRead;

        public FastInputReader(InputStream in) {
            din = new DataInputStream(in);
            buffer = new byte[1 << 16]; // 64 KB buffer
            bufferPointer = bytesRead = 0;
        }

        public int nextInt() throws IOException {
            var ret = 0;
            var c = 0;

            while (bufferPointer < bytesRead || refillBuffer()) {
                c = buffer[bufferPointer++];
                if (c > ' ') break; // Skip non-digit
            }

            var neg = (c == '-');
            if (neg) c = buffer[bufferPointer++];

            while (c >= '0' && c <= '9') {
                ret = ret * 10 + (c - '0');
                if (bufferPointer == bytesRead && !refillBuffer()) break;
                c = buffer[bufferPointer++];
            }
            return neg ? -ret : ret;
        }

        private boolean refillBuffer() throws IOException {
            bytesRead = din.read(buffer, 0, buffer.length);
            bufferPointer = 0;
            return bytesRead > 0;
        }
    }
}

• Subtask 1: 25 / 100