Submission #191046

---

Source Code Expand

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;

public class Main {
    static int toFmIndex(int t) {
        return (t / 100) * 12 + (t % 100) / 5;
    }

    static String fromFmIndex(int i) {
        return String.format("%02d%02d", i / 12, (i % 12) * 5);
    }

    static int[] toRange(String s) {
        String[] ts = s.split("-");
        int from = Integer.parseInt(ts[0], 10);
        int to = Integer.parseInt(ts[1], 10) + 4;
        return new int[]{toFmIndex(from), toFmIndex(to)};
    }

    static void print(int f,int t){
        System.out.println(fromFmIndex(f) + "-" + fromFmIndex(t));
    }

    static void solve() throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine(), 10);
        int[][] times = new int[n][];

        for (int i = 0; i < n; i++)
            times[i] = toRange(br.readLine());

        Arrays.sort(times, new Comparator<int[]>() {
            @Override
            public int compare(int[] o1, int[] o2) {
                return o1[0] != o2[0] ? (o1[0] - o2[0]) : (o1[1] - o2[1]);
            }
        });
        int from = -1, to = -1;
        for (int i = 0; i < n; i++){
            boolean p = to>=0&&times[i][0]>to; // print
            boolean u = from<0||p; // update from
            if(p)print(from,to);
            if(u)from = times[i][0];
            to = Math.max(to,times[i][1]);
        }
        if(to>=0)print(from,to);
    }
    public static void main(String... args) throws Exception {
        solve();
    }
}

Submission Info

Judge Result