Submission #335391

---

Source Code Expand

import java.util.*;

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

		n = sc.nextInt();
		start = new Integer[n];
		end = new Integer[n];
		data = new String[n];
		
		for(int i = 0; i < n; i++) data[i] = sc.next();
		sc.close();
		//時間順(昇順)ソート
		Arrays.sort(data);
		
		//降り始めと振り終わりに分ける
		separate(start,end, n, data);
		
		//雨が振った時間がかぶっている場合合成
		connect(start, end, n);
		
		//重複なしで出力
		normalization(start, end, n);

	}

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

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

			}
		}
	}

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

}

Submission Info

Judge Result