Submission #176830

---

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 ans;

    public static void main(String[] args) {

	readInput();
	Arrays.sort(SE, new MyComparator());
	round(SE);
	ans = merge(SE, ansSE);

	dump(ansSE, ans);
    }

    private static void readInput() {

	Scanner sc = new Scanner(System.in);
	N = sc.nextInt();
	SE = new int[N][2];
	ansSE = 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]);
	}
    }
    
    private static void round(int[][] SE) {
	int s, e;
	for (int i = 0; i < SE.length; 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 int merge(int[][] SE, int[][] ansSE) {

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

	for (int i = 1; i < SE.length; i++) {

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

    private static void dump(int[][] se, int n) {
	for (int i = 0; i < n; i++) {
	    for (int j = 0; j < 2; j++) {
		System.out.print(se[i][j]);
		if (j == 0) System.out.print("-");
	    }
	    System.out.println("");
	}
    }

    private static class MyComparator implements Comparator<Object> {

	@Override
	public int compare(Object o1, Object o2) {
	    int s1 = ((int[])o1)[0];
	    int s2 = ((int[])o2)[0];
	    return s1 - s2;
	}
    }
}

Submission Info

Judge Result