結果
問題 | No.945 YKC饅頭 |
ユーザー | htensai |
提出日時 | 2019-12-10 17:59:51 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,228 bytes |
コンパイル時間 | 3,174 ms |
コンパイル使用メモリ | 76,956 KB |
実行使用メモリ | 79,740 KB |
最終ジャッジ日時 | 2023-09-06 07:16:12 |
合計ジャッジ時間 | 63,839 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 169 ms
58,920 KB |
testcase_01 | AC | 170 ms
57,016 KB |
testcase_02 | AC | 231 ms
58,472 KB |
testcase_03 | AC | 268 ms
61,312 KB |
testcase_04 | AC | 222 ms
57,636 KB |
testcase_05 | AC | 229 ms
58,116 KB |
testcase_06 | AC | 245 ms
60,184 KB |
testcase_07 | AC | 239 ms
59,624 KB |
testcase_08 | AC | 196 ms
57,060 KB |
testcase_09 | AC | 249 ms
60,032 KB |
testcase_10 | AC | 246 ms
60,508 KB |
testcase_11 | AC | 238 ms
60,308 KB |
testcase_12 | AC | 236 ms
58,328 KB |
testcase_13 | AC | 263 ms
61,400 KB |
testcase_14 | AC | 268 ms
61,504 KB |
testcase_15 | AC | 250 ms
61,328 KB |
testcase_16 | AC | 226 ms
58,248 KB |
testcase_17 | AC | 266 ms
61,060 KB |
testcase_18 | AC | 243 ms
59,872 KB |
testcase_19 | AC | 189 ms
57,004 KB |
testcase_20 | AC | 227 ms
57,908 KB |
testcase_21 | AC | 231 ms
57,796 KB |
testcase_22 | AC | 273 ms
61,712 KB |
testcase_23 | AC | 276 ms
61,100 KB |
testcase_24 | AC | 269 ms
61,544 KB |
testcase_25 | AC | 273 ms
59,528 KB |
testcase_26 | AC | 273 ms
61,216 KB |
testcase_27 | AC | 170 ms
57,036 KB |
testcase_28 | AC | 173 ms
57,072 KB |
testcase_29 | AC | 168 ms
56,716 KB |
testcase_30 | AC | 170 ms
57,192 KB |
testcase_31 | AC | 433 ms
61,368 KB |
testcase_32 | AC | 310 ms
61,904 KB |
testcase_33 | AC | 906 ms
69,076 KB |
testcase_34 | AC | 1,317 ms
70,988 KB |
testcase_35 | AC | 1,626 ms
75,868 KB |
testcase_36 | AC | 1,546 ms
75,728 KB |
testcase_37 | AC | 1,503 ms
72,108 KB |
testcase_38 | AC | 1,448 ms
71,088 KB |
testcase_39 | AC | 683 ms
62,928 KB |
testcase_40 | AC | 632 ms
62,156 KB |
testcase_41 | AC | 408 ms
62,028 KB |
testcase_42 | AC | 1,674 ms
75,304 KB |
testcase_43 | AC | 1,775 ms
72,672 KB |
testcase_44 | AC | 1,502 ms
73,208 KB |
testcase_45 | AC | 1,789 ms
76,400 KB |
testcase_46 | AC | 315 ms
61,808 KB |
testcase_47 | AC | 1,373 ms
70,908 KB |
testcase_48 | AC | 712 ms
63,540 KB |
testcase_49 | AC | 954 ms
67,732 KB |
testcase_50 | AC | 1,893 ms
77,888 KB |
testcase_51 | TLE | - |
testcase_52 | AC | 1,842 ms
77,712 KB |
testcase_53 | AC | 1,906 ms
77,576 KB |
testcase_54 | AC | 1,893 ms
78,300 KB |
testcase_55 | AC | 1,905 ms
79,740 KB |
testcase_56 | AC | 194 ms
56,972 KB |
testcase_57 | AC | 186 ms
57,188 KB |
testcase_58 | AC | 1,439 ms
71,236 KB |
testcase_59 | AC | 1,367 ms
74,788 KB |
testcase_60 | AC | 995 ms
68,132 KB |
testcase_61 | AC | 1,432 ms
71,384 KB |
testcase_62 | AC | 1,426 ms
71,020 KB |
testcase_63 | AC | 305 ms
61,532 KB |
testcase_64 | AC | 976 ms
67,484 KB |
testcase_65 | AC | 887 ms
67,732 KB |
testcase_66 | AC | 862 ms
67,580 KB |
testcase_67 | AC | 1,263 ms
69,380 KB |
testcase_68 | AC | 1,003 ms
67,588 KB |
testcase_69 | AC | 564 ms
61,848 KB |
testcase_70 | AC | 656 ms
61,852 KB |
testcase_71 | AC | 636 ms
61,976 KB |
testcase_72 | AC | 1,148 ms
69,592 KB |
testcase_73 | AC | 1,417 ms
74,340 KB |
ソースコード
import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); PriorityQueue<Order> leftQueue = new PriorityQueue<Order>(new Comparator<Order>() { public int compare(Order o1, Order o2) { return o1.left - o2.left; } }); PriorityQueue<Order> rightQueue = new PriorityQueue<Order>(new Comparator<Order>() { public int compare(Order o1, Order o2) { return o1.right - o2.right; } }); for (int i = 0; i < m; i++) { Order or = new Order(i, sc.nextInt(), sc.nextInt(), sc.next().charAt(0)); leftQueue.add(or); rightQueue.add(or); } TreeSet<Order> set = new TreeSet<Order>(new Comparator<Order>() { public int compare(Order o1, Order o2) { return o1.idx - o2.idx; } }); int[] counts = new int[3]; for (int i = 1; i <= n; i++) { while (leftQueue.size() > 0 && leftQueue.peek().left == i) { set.add(leftQueue.poll()); } if (set.size() == 0) { continue; } counts[set.first().type]++; while (rightQueue.size() > 0 && rightQueue.peek().right == i) { set.remove(rightQueue.poll()); } } System.out.print(counts[0] + " " + counts[1] + " " + counts[2]); } static class Order { int idx; int left; int right; int type; public Order (int idx, int left, int right, char typeC) { this.idx = idx; this.left = left; this.right = right; if (typeC == 'Y') { type = 0; } else if (typeC == 'K') { type = 1; } else { type = 2; } } public int hashCode() { return idx; } public boolean equals(Object o) { Order or = (Order) o; return idx == or.idx; } } }