Submission #1713999


Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.InputMismatchException;
import java.util.List;
import java.util.NoSuchElementException;

public class Main {
	static IO io = new IO();
	public static void main(String[] args) {
		int n = io.nextInt();
		int t[] = new int[24*60/5 + 1];
		for (int i=0; i<n; i++) {
			String ge = io.next();
			int s = Integer.parseInt(ge.substring(0,2))*60 + Integer.parseInt(ge.substring(2,4));
			int e = Integer.parseInt(ge.substring(5,7))*60 + Integer.parseInt(ge.substring(7,9));
			s -= s%5;
			if (e%5!=0) e += 5 - e%5;
			t[s/5] ++;
			t[e/5] --;
		}
		List<Integer> s = new ArrayList<Integer>();
		List<Integer> e = new ArrayList<Integer>();
		int cnt = 0;
		for (int i=0; i<=24*12; i++) {
			if (t[i]>0) {
				if (cnt==0) s.add(i);
				cnt += t[i];
			}
			if (t[i]<0) {
				cnt += t[i];
				if (cnt==0) e.add(i);
			}
		}
		
		for (int i=0; i<s.size(); i++) {
			int st = s.get(i)*5;
			String sh = String.valueOf(st/60);
			String sm = String.valueOf(st%60);
			if (sh.length()==1) sh = "0" + sh;
			if (sm.length()==1) sm = "0" + sm;
			System.out.print(sh + sm + "-");
			
			int et = e.get(i)*5;
			String eh = String.valueOf(et/60);
			String em = String.valueOf(et%60);
			if (eh.length()==1) eh = "0" + eh;
			if (em.length()==1) em = "0" + em;
			System.out.println(eh + em);	
		}

	}
	
	static class IO extends PrintWriter {
		private final InputStream in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;

		public IO() { this(System.in);}
		public IO(InputStream source) { super(System.out); this.in = source;}
		private boolean hasNextByte() {
			if (ptr < buflen) {
				return true;
			}else{
				ptr = 0;
				try {
					buflen = in.read(buffer);
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (buflen <= 0) {
					return false;
				}
			}
			return true;
		}
		private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
		private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
		private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
		private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
		private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;}
		public boolean hasNext() { skipUnprintable(); return hasNextByte();}
		public boolean hasNextLine() { skipNewLine(); return hasNextByte();}
		public String next() {
			if (!hasNext()) {
				throw new NoSuchElementException();
			}
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while(isPrintableChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
		public char[] nextCharArray(int len) {
			if (!hasNext()) {
				throw new NoSuchElementException();
			}
			char[] s = new char[len];
			int i = 0;
			int b = readByte();
			while(isPrintableChar(b)) {
				if (i == len) {
					throw new InputMismatchException();
				}
				s[i++] = (char) b;
				b = readByte();
			}
			return s;
		}
		public String nextLine() {
			if (!hasNextLine()) {
				throw new NoSuchElementException();
			}
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while(!isNewLine(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
		public long nextLong() {
			if (!hasNext()) {
				throw new NoSuchElementException();
			}
			long n = 0;
			boolean minus = false;
			int b = readByte();
			if (b == '-') {
				minus = true;
				b = readByte();
			}
			if (b < '0' || '9' < b) {
				throw new NumberFormatException();
			}
			while(true){
				if ('0' <= b && b <= '9') {
					n *= 10;
					n += b - '0';
				}else if(b == -1 || !isPrintableChar(b)){
					return minus ? -n : n;
				}else{
					throw new NumberFormatException();
				}
				b = readByte();
			}
		}
		public int nextInt() {
			long nl = nextLong();
			if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
				throw new NumberFormatException();
			}
			return (int) nl;
		}
		public char nextChar() {
			if (!hasNext()) {
				throw new NoSuchElementException();
			}
			return (char) readByte();
		}
		public double nextDouble() { return Double.parseDouble(next());}
		public int[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
		public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
		public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
		public void arrayInt(int[]... a) {for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
		public int[][] matrixInt(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;}
		public char[][] charMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
		public void close() {
			super.close();
			try {
				in.close();
			} catch (IOException e) {}
		}
	}
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User creep04
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 5293 Byte
Status AC
Exec Time 147 ms
Memory 33308 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 48
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 74 ms 21076 KB
00_sample_02.txt AC 74 ms 21204 KB
00_sample_03.txt AC 74 ms 18772 KB
cho_cho_chokudai.txt AC 131 ms 32484 KB
chokudai_ga_cho.txt AC 141 ms 32212 KB
test_01.txt AC 98 ms 20692 KB
test_02.txt AC 98 ms 20180 KB
test_03.txt AC 99 ms 20948 KB
test_04.txt AC 98 ms 21716 KB
test_05.txt AC 89 ms 22996 KB
test_06.txt AC 81 ms 21844 KB
test_07.txt AC 79 ms 21588 KB
test_08.txt AC 78 ms 21460 KB
test_09.txt AC 84 ms 21332 KB
test_10.txt AC 96 ms 19796 KB
test_11.txt AC 83 ms 19668 KB
test_12.txt AC 81 ms 23508 KB
test_13.txt AC 79 ms 18516 KB
test_14.txt AC 82 ms 21076 KB
test_15.txt AC 86 ms 22996 KB
test_16.txt AC 90 ms 18900 KB
test_17.txt AC 83 ms 21716 KB
test_18.txt AC 88 ms 19924 KB
test_19.txt AC 82 ms 21332 KB
test_20.txt AC 83 ms 21588 KB
test_21.txt AC 139 ms 31436 KB
test_22.txt AC 141 ms 33004 KB
test_23.txt AC 141 ms 30436 KB
test_24.txt AC 141 ms 30176 KB
test_25.txt AC 140 ms 33124 KB
test_26.txt AC 133 ms 30696 KB
test_27.txt AC 131 ms 33092 KB
test_28.txt AC 144 ms 33308 KB
test_29.txt AC 73 ms 19156 KB
test_30.txt AC 76 ms 19156 KB
test_31.txt AC 106 ms 21716 KB
test_32.txt AC 75 ms 21204 KB
test_33.txt AC 137 ms 29112 KB
test_34.txt AC 73 ms 20180 KB
test_35.txt AC 81 ms 19284 KB
test_36.txt AC 143 ms 33252 KB
test_37.txt AC 135 ms 29420 KB
test_38.txt AC 140 ms 31172 KB
test_39.txt AC 147 ms 31716 KB
test_40.txt AC 143 ms 33224 KB
test_41.txt AC 142 ms 28768 KB
test_42.txt AC 141 ms 32360 KB
test_43.txt AC 140 ms 33124 KB