Submission #171118

---

Source Code Expand

import java.util.Iterator;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int num = sc.nextInt();
		TreeMap<Integer, Integer> map = new TreeMap<Integer, Integer>();
		//
		for (int i=0; i<num; i++) {
			String[] str = sc.next().split("-");
			int beginTime = ((int)(Integer.valueOf(str[0])/5))*5;
			int endTime = (int)Math.ceil(Integer.valueOf(str[1])/5.0)*5;
			if (String.valueOf(endTime).endsWith("60")) endTime+=40;
			if (map.containsKey(beginTime)) {
				if (map.get(beginTime)<endTime) {
					map.put(beginTime, endTime);
				}
			} else {
				map.put(beginTime, endTime);
			}
		}
		//
		Iterator<Entry<Integer, Integer>> it = map.entrySet().iterator();
		TreeMap<Integer, Integer> map2 = new TreeMap<Integer, Integer>();
		Entry<Integer, Integer> firstEntry = it.next();
		map2.put(firstEntry.getKey(), firstEntry.getValue());
		while (it.hasNext()) {
			Entry<Integer, Integer> e = it.next();
			Entry<Integer, Integer> lastEntry = map2.lastEntry();
			if (lastEntry.getValue()>=e.getKey()) {
				map2.put(lastEntry.getKey(), Math.max(lastEntry.getValue(), e.getValue()));
			} else {
				map2.put(e.getKey(), e.getValue());
			}
		}
		//
		for (it=map2.entrySet().iterator(); it.hasNext();) {
			Entry<Integer, Integer> e = it.next();
			System.out.println(String.format("%04d-%04d", e.getKey(), e.getValue()));
		}
		sc.close();
	}
}

Submission Info

Judge Result