Submission #5780258

---

Source Code Expand

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

public class Main {
  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);

    int N = scanner.nextInt();
    Point[] points = new Point[N * 2];
    for (int i = 0; i < N; i++) {
      String[] line = scanner.next().split("-");
      int s = Integer.parseInt(line[0]);
      int e = Integer.parseInt(line[1]);
      s = s / 5 * 5;
      e = (e + 4) / 5 * 5;
      if (e % 100 == 60) e += 40;
      points[i * 2] = new Point(s, true);
      points[i * 2 + 1] = new Point(e, false);
    }

    Arrays.sort(points, Comparator.comparingInt(p -> p.pos * 2 + (p.start ? 0 : 1)));

    int count = 0;
    int start = -1;
    List<int[]> list = new ArrayList<>();
    for (int i = 0; i < N * 2; i++) {
      if (points[i].start) {
        if (count == 0) start = points[i].pos;
        count++;
      } else {
        count--;
      }
      if (count == 0) {
        list.add(new int[]{start, points[i].pos});
        start = -1;
      }
    }
    for (int[] p : list) System.out.printf("%04d-%04d\n", p[0], p[1]);
  }

  private static class Point {
    private final int pos;
    private final boolean start;

    private Point(int pos, boolean start) {
      this.pos = pos;
      this.start = start;
    }
  }
}

Submission Info

Judge Result