Submission #657224

---

Source Code Expand

import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.math.BigInteger;

public class Main{

static PrintWriter out;
static InputReader ir;

static void solve(){
 int n=ir.nextInt();
 ArrayList<int[]> seg=new ArrayList<>();
 for(int i=0;i<n;i++){
  String t=ir.next();
  int m=Integer.parseInt(t.substring(0,2));
  int s=Integer.parseInt(t.substring(2));
  s-=s%5;
  t=ir.next();
  int mm=Integer.parseInt(t.substring(0,2));
  int ss=Integer.parseInt(t.substring(2));
  if(ss%5!=0) ss+=5-ss%5;
  seg.add(new int[]{m*60+s,mm*60+ss});
 }
 UniteSegmentsAndGetTotalLength(seg,1);
 for(int[] r : seg){
  for(int i=0;i<2;i++){
   int a=r[i]/60,b=r[i]%60;
   out.print((a<10?"0":"")+a+(b<10?"0":"")+b);
   if(i==0) out.print("-");
   else out.println();
  }
 }
}

static long UniteSegmentsAndGetTotalLength(ArrayList<int[]> seg,int k){
 int n=seg.size();
 Point[] ps=new Point[2*n];
 for(int i=0;i<n;i++){
  int[] s=seg.get(i);
  ps[2*i]=new Point(s[0],true);
  ps[2*i+1]=new Point(s[1],false);
 }
 seg.clear();
 Arrays.sort(ps,new Comparator<Point>(){
  public int compare(Point a,Point b){
   if(a.pos!=b.pos) return Integer.compare(a.pos,b.pos);
   if(a.isLeftSide==b.isLeftSide) return 0;
   if(a.isLeftSide) return -1;
   return 1;
  }
 });
 int cur=0,l=-1;
 long ret=0;
 boolean f=false;
 for(int i=0;i<2*n;i++){
  cur+=ps[i].isLeftSide?1:-1;
  if(cur>=k&&!f){
   f=true;
   l=ps[i].pos;
  }
  else if(cur<k&&f){
   f=false;
   if(l!=ps[i].pos) seg.add(new int[]{l,ps[i].pos});
   ret+=ps[i].pos-l;
  }
 }
 return ret;
}

static class Point{

 public int pos;
 public boolean isLeftSide;

 public Point(int pos,boolean isLeftSide){
  this.pos=pos;
  this.isLeftSide=isLeftSide;
 }
}

public static void main(String[] args) throws Exception{
 ir=new InputReader(System.in);
 out=new PrintWriter(System.out);
 solve();
 out.flush();
}

static class InputReader {

 private InputStream in;
 private byte[] buffer=new byte[1024];
 private int curbuf;
 private int lenbuf;

 public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}
 
 public boolean hasNextByte() {
  if(curbuf>=lenbuf){
   curbuf= 0;
   try{
    lenbuf=in.read(buffer);
   }catch(IOException e) {
    throw new InputMismatchException();
   }
   if(lenbuf<=0) return false;
  }
  return true;
 }

 private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
 
 private boolean isSpaceChar(int c){return !(c>=33&&c<=126)||c=='-';}
 
 private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
 
 public boolean hasNext(){skip(); return hasNextByte();}
 
 public String next(){
  if(!hasNext()) throw new NoSuchElementException();
  StringBuilder sb=new StringBuilder();
  int b=readByte();
  while(!isSpaceChar(b)){
   sb.appendCodePoint(b);
   b=readByte();
  }
  return sb.toString();
 }
 
 public int nextInt() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  int res=0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
 
 public long nextLong() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  long res = 0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }

 public double nextDouble(){return Double.parseDouble(next());}

 public int[] nextIntArray(int n){
  int[] a=new int[n];
  for(int i=0;i<n;i++) a[i]=nextInt();
  return a;
 }

 public long[] nextLongArray(int n){
  long[] a=new long[n];
  for(int i=0;i<n;i++) a[i]=nextLong();
  return a;
 }

 public char[][] nextCharMap(int n,int m){
  char[][] map=new char[n][m];
  for(int i=0;i<n;i++) map[i]=next().toCharArray();
  return map;
 }
}
}

Submission Info

Judge Result