Submission #4575883

---

Source Code Expand

import java.util.*;

public class Main {

	private static class pair implements Comparable<pair> {
		private final int left;
		private final int right;

		public pair(int left, int right) {
			this.left = left;
			this.right = right;
		}

		public int compareTo(pair p) {
			if (left > p.left)
				return 1;
			else if (left < p.left)
				return -1;
			else {
				if (right > p.right)
					return 1;
				else if (right < p.right)
					return -1;
				else
					return 0;
			}
		}
	}

	public static String time(int t) {
		StringBuffer ans = new StringBuffer();
		ans.append(String.valueOf(t));
		int n = ans.length();
		if (n != 4) {
			StringBuffer tmp = new StringBuffer();
			for (int i = 0; i < 4 - n; ++i) {
				tmp.append("0");
			}
			ans.insert(0, tmp);
		}
		return ans.toString();
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		pair st[] = new pair[n + 1];
		for (int i = 0; i < n; ++i) {
			String tmp = sc.next();
			int s = Integer.parseInt(tmp.substring(0, 4));
			int r = s % 5;
			s -= r;
			int e = Integer.parseInt(tmp.substring(5));
			r = e % 5;
			if (r != 0) {
				int tmpr = e % 100;
				if (tmpr > 55 && tmpr <= 59) {
					r = 100 - tmpr;
				} else
					r = 5 - r;
			}
			e += r;
			st[i] = new pair(s, e);
		}
		sc.close();
		st[n] = new pair(2401, 0);
		Arrays.sort(st);
		String ans = "";
		int max = 0;
		for (int i = 0; i < n; ++i) {
			if (ans.length() < 1) {
				ans = time(st[i].left) + "-";
			}
			if (max == 0)
				max = st[i].right;
			if (max >= st[i + 1].left) {
				max = Math.max(max, st[i].right);
				max = Math.max(max, st[i + 1].right);
			} else {
				ans += time(max);
				System.out.println(ans);
				ans = "";
				max = 0;
			}
		}
	}

}

Submission Info

Judge Result