Submission #176848

---

Source Code Expand

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {

	static int SE[][];
	static int ansSE[][];
	static int N;
	static int index;

	public static void main(String[] args) {
		readInput();
		Arrays.sort(SE, new MyComparator());
		merge();
		round();
		merge();
		dump();
	}

	private static void readInput() {
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		SE = new int[N][2];
		String temp[] = new String[2];

		for (int i = 0; i < N; i++) {
			temp = (sc.next()).split("-");
			SE[i][0] = Integer.parseInt(temp[0]);
			SE[i][1] = Integer.parseInt(temp[1]);
		}
		sc.close();
	}

	private static void merge() {

		int srt = SE[0][0];
		int end = SE[0][1];
		int index = 0;

		for (int i = 1; i < N; i++) {

			if (SE[i][0] <= end) {
				if (SE[i][1] > end) {
					end = SE[i][1];
				}
			} else {
				SE[index][0] = srt;
				SE[index][1] = end;
				srt = SE[i][0];
				end = SE[i][1];
				index++;
			}
		}
		SE[index][0] = srt;
		SE[index][1] = end;
		N = index + 1;
	}

	private static void round() {
		int s, e;
		for (int i = 0; i < N; i++) {
			s = SE[i][0];
			e = SE[i][1];
			s = s - (s % 5);
			if ((e % 5) != 0)
				e = e + (5 - e % 5);
			if ((e % 100) == 60) {
				e = e + 40;
			}
			SE[i][0] = s;
			SE[i][1] = e;
		}
	}

	private static void dump() {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < 2; j++) {
				if (SE[i][j] < 10) {
					System.out.print("0");
				}
				if (SE[i][j] < 100) {
					System.out.print("0");
				}
				if (SE[i][j] < 1000) {
					System.out.print("0");
				}
				System.out.print(SE[i][j]);
				if (j == 0)
					System.out.print("-");
			}
			System.out.println("");
		}
	}

	private static class MyComparator implements Comparator<Object> {
		public int compare(Object o1, Object o2) {
			int s1 = ((int[]) o1)[0];
			int s2 = ((int[]) o2)[0];
			return s1 - s2;
		}
	}
}

Submission Info

Judge Result