Submission #401919

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
401919	2021-05-11T01:47:33 Z	rainliofficial	Job Scheduling (CEOI12_jobs)	Java 11	0 / 100	1000 ms	65540 KB

jobs

import java.io.*;
import java.util.*;

public class jobs { 
    static int n, d, m;
    public static void main(String[] args) throws IOException{
        BufferedReader file = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(file.readLine());
        n = Integer.parseInt(st.nextToken());
        d = Integer.parseInt(st.nextToken());
        m = Integer.parseInt(st.nextToken());
        int[][] arr = new int[m][2];
        st = new StringTokenizer(file.readLine());
        for (int i=0; i<m; i++){
            arr[i] = new int[] {Integer.parseInt(st.nextToken()), i+1};
        }
        Arrays.sort(arr, (a, b) -> a[0]-b[0]);
        int low = 0;
        int high = n;
        while (low < high){
            int mid = (low + high)/2;
            if (check(mid, arr)){
                high = mid;
            }else{
                low = mid+1;
            }
        }
        System.out.println(low);
        ArrayList<Integer>[] eachDay = new ArrayList[n];
        for (int i=0; i<n; i++){
            eachDay[i] = new ArrayList<>();
        }
        int[] end = new int[low];
        for (int i=0, id = 0; i<m; i++, id++){
            if (id == low){
                id = 0;
            }
            int requestDay = arr[i][0];
            int canDo = end[id];
            end[id] = Math.max(requestDay-1, canDo); // Only does work when the request comes
            eachDay[end[id]].add(arr[i][1]);
        }
        for (int i=0; i<n; i++){
            if (eachDay[i] != null){
                for (int j : eachDay[i]){
                    System.out.print(j + " ");
                }
            }
            System.out.print("0");
            System.out.println();
        }
    }
    public static boolean check(int mid, int[][] arr){
        int[] end = new int[mid]; // Tracks when a machine ends its job
        int index = 0;
        int maxD = 0;
        for (int i=0; i<m; i++){
            if (index == mid){
                index = 0;
            }
            if (end[index]+1 > arr[i][0]){
                maxD = Math.max(maxD, end[index]+1-arr[i][0]);
                end[index]++;
            }else{
                end[index] = arr[i][0]; // No delay
            }
            index++;
        }
        return maxD <= d;
    }
}

Compilation message

Note: jobs.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1091 ms	21684 KB	Time limit exceeded
2	Execution timed out	1096 ms	21556 KB	Time limit exceeded
3	Execution timed out	1083 ms	21716 KB	Time limit exceeded
4	Execution timed out	1097 ms	21700 KB	Time limit exceeded
5	Execution timed out	1094 ms	21836 KB	Time limit exceeded
6	Execution timed out	1085 ms	21684 KB	Time limit exceeded
7	Execution timed out	1094 ms	21520 KB	Time limit exceeded
8	Execution timed out	1090 ms	21716 KB	Time limit exceeded
9	Execution timed out	1099 ms	21820 KB	Time limit exceeded
10	Execution timed out	1094 ms	21476 KB	Time limit exceeded
11	Execution timed out	1094 ms	21620 KB	Time limit exceeded
12	Execution timed out	1088 ms	29436 KB	Time limit exceeded
13	Execution timed out	1103 ms	40412 KB	Time limit exceeded
14	Execution timed out	1100 ms	47632 KB	Time limit exceeded
15	Execution timed out	1094 ms	51516 KB	Time limit exceeded
16	Execution timed out	1095 ms	57040 KB	Time limit exceeded
17	Runtime error	607 ms	65536 KB	Execution killed with signal 9
18	Runtime error	512 ms	65540 KB	Execution killed with signal 9
19	Runtime error	521 ms	65540 KB	Execution killed with signal 9
20	Runtime error	640 ms	65540 KB	Execution killed with signal 9