Submission #335306

---

Source Code Expand

import java.util.*;

public class Main {
	public static void main(String[] args)
	{
		int n;
		Integer [] start, end;
		Scanner sc = new Scanner(System.in);

		n = sc.nextInt();
		start = new Integer[n];
		end = new Integer[n];

		//降り始めと振り終わりに分ける
		separate(start,end, n, sc);

		//降り始めを基準にして昇順にソート
		ssort(start, end, n);

		//雨が振った時間がかぶっている場合合成
		connect(start, end, n);
		
		//重複なしで出力
		normalization(start, end, n);

	}

	private static void separate(Integer[] start, Integer[] end, int n, Scanner sc)
	{
		int i, tmp;
		for(i = 0; i < n; i++){
			String[] change = (sc.next()).split("-");
			tmp = Integer.parseInt(change[0]);
			start[i] = (tmp - (tmp % 5));
			tmp = Integer.parseInt(change[1]) + 4;
			end[i] = tmp - (tmp % 5);
			//System.out.println(start[i]);
			//System.out.println(end[i]);
		}
	}

	private static void ssort(Integer[] start, Integer[] end, int n)
	{
		int i,k, idx, tmp, min;
		for(i = 0; i < n; i++){
			min = start[i];
			idx = i;
			for(k = i + 1; k < n; k++){
				if(start[k] < min){
					min = start[k];
					idx = k;
				}
			}
			tmp = start[idx];
			start[idx] = start[i];
			start[i] = tmp;
			tmp = end[idx];
			end[idx] = end[i];
			end[i] = tmp;
		}
	}

	private static void connect(Integer[] start, Integer[] end, int n)
	{
		int i,k,s,e,s2,e2;
		for(i = 0; i < n; i++){
			s = start[i]; e = end[i]; 
			for(k = i + 1; k < n; k++){
				s2 = start[k]; e2 = end[k];
				if(s2 <= e){
					start[k] = start[i];
					if(e2 <= e){
						end[k] = end[i];
					} else {
						end[i] = end[k];
					}
				}

			}
		}
	}

	private static void normalization(Integer[] start, Integer[] end, int n)
	{
		int i,search;
		search = start[0];
		System.out.println(String.format("%04d-%04d", start[0], end[0]));
		for(i = 0; i < n; i++){
			//System.out.println(start[i] + "-" + end[i]);
			if(search != start[i]){
				System.out.println(String.format("%04d-%04d", start[i], end[i]));
				search = start[i];
			}
		}
	}

}

Submission Info

Judge Result