Submission #108507

---

Source Code Expand

import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.Scanner;

public class Main {
    
    class Rain implements Comparable<Rain>{
        int start;
        int finish;
        
        Rain(int start, int finish) {
           this.start  =  makeStart(start); 
           this.finish = makeFinish(finish);
        }
        
        int makeStart (int start) {
            int num = start % 10;
            if (num >= 5) 
                return start/10*10+5;
            else 
                return start/10*10;
        }
        
        int makeFinish(int finish) {
            int num = finish % 10;
            if(num == 0)
                return finish;
            else if (num <= 5)
                return finish/10*10 +5;
            else {
                int n = (finish/10+1) % 10;
                if(n == 6) {
                    return (finish/100+1)*100;
                }
                else 
                    return (finish/10+1)*10;
            }
        }

        @Override
        public int compareTo(Rain o)
        {
            return this.start - o.start != 0 ? this.start - o.start : this.finish - o.finish;
        }
        
        public String toString() {
            return makeStr(start) + "-" + makeStr(finish);
        }
        
        public String makeStr(int start) {
            String startStr = ""+start;
            if (start / 1000 >= 1) {
                
            }
            else if(start / 100 >= 1) {
                startStr = "0" + startStr;
            }
            else if(start / 10 >= 1) {
                startStr = "00" + startStr;
            }
            else 
                startStr = "000" + startStr;
            return startStr;
        }
    }
    
	public void run() {
		Scanner sc = new Scanner(System.in);
		while (sc.hasNext()) {
		    int N = sc.nextInt();
		    PriorityQueue<Rain> queue = new PriorityQueue<Main.Rain>();
		    sc.nextLine();
		    for (int i = 0; i < N; i++)
            {
		       String[] line = sc.nextLine().split("-");
		       queue.add(new Rain(Integer.valueOf(line[0]), Integer.valueOf(line[1])));
            }
		    ArrayList<Rain>results = appendRains(queue);
		    
		    for (Rain rain : results)
            {
               System.out.println(rain); 
            }
		}
	}
	
	public ArrayList<Rain> appendRains (PriorityQueue<Rain> queue) {
	    ArrayList<Rain> results = new ArrayList<Main.Rain>();
	    while(queue.size() >= 2) {
	        Rain r1 = queue.poll();
	        Rain r2 = queue.poll();
	        
	        if(r1.finish >= r2.start) {
	            queue.add(new Rain(r1.start, Math.max(r1.finish, r2.finish)));
	        }
	        else {
	            results.add(r1);
	            queue.add(r2);
	        }
	    }
	    while(!queue.isEmpty()) {
	        results.add(queue.poll());
	    }
	    return results;
	}

	public static void main(String[] args) {
		new Main().run();
	}
}

Submission Info

Judge Result