結果
問題 | No.580 旅館の予約計画 |
ユーザー | Grenache |
提出日時 | 2017-12-10 20:15:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 205 ms / 2,000 ms |
コード長 | 5,029 bytes |
コンパイル時間 | 4,463 ms |
コンパイル使用メモリ | 91,988 KB |
実行使用メモリ | 43,280 KB |
最終ジャッジ日時 | 2024-05-07 16:59:01 |
合計ジャッジ時間 | 10,260 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
37,488 KB |
testcase_01 | AC | 61 ms
37,308 KB |
testcase_02 | AC | 65 ms
37,688 KB |
testcase_03 | AC | 70 ms
38,044 KB |
testcase_04 | AC | 75 ms
38,308 KB |
testcase_05 | AC | 67 ms
37,780 KB |
testcase_06 | AC | 75 ms
37,940 KB |
testcase_07 | AC | 85 ms
38,352 KB |
testcase_08 | AC | 79 ms
38,296 KB |
testcase_09 | AC | 84 ms
38,208 KB |
testcase_10 | AC | 88 ms
38,208 KB |
testcase_11 | AC | 93 ms
38,396 KB |
testcase_12 | AC | 135 ms
39,356 KB |
testcase_13 | AC | 97 ms
38,100 KB |
testcase_14 | AC | 111 ms
38,940 KB |
testcase_15 | AC | 196 ms
42,948 KB |
testcase_16 | AC | 174 ms
41,288 KB |
testcase_17 | AC | 178 ms
41,660 KB |
testcase_18 | AC | 181 ms
41,460 KB |
testcase_19 | AC | 205 ms
43,280 KB |
testcase_20 | AC | 160 ms
41,024 KB |
testcase_21 | AC | 171 ms
40,788 KB |
testcase_22 | AC | 135 ms
39,992 KB |
testcase_23 | AC | 159 ms
40,396 KB |
testcase_24 | AC | 167 ms
40,248 KB |
testcase_25 | AC | 149 ms
40,740 KB |
testcase_26 | AC | 70 ms
37,816 KB |
testcase_27 | AC | 71 ms
38,084 KB |
testcase_28 | AC | 72 ms
37,976 KB |
testcase_29 | AC | 71 ms
37,968 KB |
testcase_30 | AC | 156 ms
40,488 KB |
testcase_31 | AC | 179 ms
41,688 KB |
testcase_32 | AC | 143 ms
40,164 KB |
testcase_33 | AC | 182 ms
42,688 KB |
testcase_34 | AC | 140 ms
40,068 KB |
testcase_35 | AC | 66 ms
37,856 KB |
ソースコード
import java.io.*; import java.util.*; public class Main_yukicoder580 { private static Scanner sc; private static Printer pr; private static void solve() { int n = sc.nextInt(); int m = sc.nextInt(); int[] in = new int[m]; int[] out = new int[m]; // int max = 60 * 24 * 9; for (int i = 0; i < m; i++) { int d = sc.nextInt(); String[] hm = sc.next().split(":"); int o = sc.nextInt(); String[] ohm = sc.next().split(":"); in[i] = d * 60 * 24 + Integer.parseInt(hm[0]) * 60 + Integer.parseInt(hm[1]); out[i] = o * 60 * 24 + Integer.parseInt(ohm[0]) * 60 + Integer.parseInt(ohm[1]) + 1; } List<Integer> list = new ArrayList<>(m); for (int i = 0; i < m; i++) { list.add(i); } Collections.sort(list, (o1, o2) -> {if (out[o1] == out[o2]) return Integer.compare(in[o2], in[o1]); else return Integer.compare(out[o1], out[o2]);}); PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder()); for (int i = 0; i < n; i++) { pq.add(0); } int ans = 0; out: for (int e : list) { List<Integer> tmp = new ArrayList<>(); while (!pq.isEmpty()) { int ee = pq.remove(); if (ee > in[e]) { tmp.add(ee); } else { pq.add(out[e]); pq.addAll(tmp); continue out; } } pq.addAll(tmp); ans++; } pr.println(m - ans); } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }