結果
問題 | No.945 YKC饅頭 |
ユーザー | htensai |
提出日時 | 2019-12-10 18:43:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,960 ms / 2,000 ms |
コード長 | 2,608 bytes |
コンパイル時間 | 2,590 ms |
コンパイル使用メモリ | 79,528 KB |
実行使用メモリ | 76,084 KB |
最終ジャッジ日時 | 2023-09-06 07:24:12 |
合計ジャッジ時間 | 54,560 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 163 ms
56,640 KB |
testcase_01 | AC | 162 ms
57,076 KB |
testcase_02 | AC | 172 ms
56,792 KB |
testcase_03 | AC | 189 ms
57,176 KB |
testcase_04 | AC | 166 ms
56,644 KB |
testcase_05 | AC | 187 ms
57,648 KB |
testcase_06 | AC | 194 ms
57,448 KB |
testcase_07 | AC | 189 ms
57,112 KB |
testcase_08 | AC | 165 ms
56,840 KB |
testcase_09 | AC | 187 ms
57,112 KB |
testcase_10 | AC | 190 ms
57,788 KB |
testcase_11 | AC | 174 ms
57,252 KB |
testcase_12 | AC | 177 ms
57,184 KB |
testcase_13 | AC | 187 ms
57,028 KB |
testcase_14 | AC | 197 ms
57,604 KB |
testcase_15 | AC | 177 ms
57,124 KB |
testcase_16 | AC | 174 ms
56,828 KB |
testcase_17 | AC | 196 ms
57,020 KB |
testcase_18 | AC | 192 ms
57,636 KB |
testcase_19 | AC | 164 ms
56,764 KB |
testcase_20 | AC | 167 ms
56,816 KB |
testcase_21 | AC | 168 ms
57,156 KB |
testcase_22 | AC | 186 ms
56,984 KB |
testcase_23 | AC | 198 ms
57,620 KB |
testcase_24 | AC | 207 ms
57,284 KB |
testcase_25 | AC | 204 ms
57,076 KB |
testcase_26 | AC | 201 ms
57,344 KB |
testcase_27 | AC | 163 ms
56,640 KB |
testcase_28 | AC | 165 ms
55,000 KB |
testcase_29 | AC | 159 ms
56,988 KB |
testcase_30 | AC | 161 ms
57,176 KB |
testcase_31 | AC | 344 ms
60,956 KB |
testcase_32 | AC | 245 ms
57,488 KB |
testcase_33 | AC | 599 ms
63,516 KB |
testcase_34 | AC | 1,177 ms
69,824 KB |
testcase_35 | AC | 1,620 ms
71,016 KB |
testcase_36 | AC | 1,554 ms
73,100 KB |
testcase_37 | AC | 1,379 ms
70,524 KB |
testcase_38 | AC | 1,300 ms
70,392 KB |
testcase_39 | AC | 448 ms
63,952 KB |
testcase_40 | AC | 410 ms
62,148 KB |
testcase_41 | AC | 315 ms
59,880 KB |
testcase_42 | AC | 1,618 ms
72,580 KB |
testcase_43 | AC | 1,411 ms
71,464 KB |
testcase_44 | AC | 1,298 ms
70,300 KB |
testcase_45 | AC | 1,817 ms
72,976 KB |
testcase_46 | AC | 209 ms
55,568 KB |
testcase_47 | AC | 1,118 ms
69,680 KB |
testcase_48 | AC | 475 ms
63,168 KB |
testcase_49 | AC | 588 ms
60,936 KB |
testcase_50 | AC | 1,757 ms
76,084 KB |
testcase_51 | AC | 1,788 ms
74,132 KB |
testcase_52 | AC | 1,960 ms
74,260 KB |
testcase_53 | AC | 1,816 ms
73,968 KB |
testcase_54 | AC | 1,856 ms
74,184 KB |
testcase_55 | AC | 1,803 ms
71,920 KB |
testcase_56 | AC | 183 ms
57,020 KB |
testcase_57 | AC | 177 ms
57,168 KB |
testcase_58 | AC | 1,192 ms
68,168 KB |
testcase_59 | AC | 1,234 ms
70,240 KB |
testcase_60 | AC | 576 ms
65,672 KB |
testcase_61 | AC | 1,161 ms
70,216 KB |
testcase_62 | AC | 1,180 ms
67,760 KB |
testcase_63 | AC | 231 ms
59,892 KB |
testcase_64 | AC | 605 ms
65,152 KB |
testcase_65 | AC | 536 ms
64,796 KB |
testcase_66 | AC | 515 ms
63,716 KB |
testcase_67 | AC | 843 ms
68,224 KB |
testcase_68 | AC | 590 ms
65,984 KB |
testcase_69 | AC | 365 ms
62,752 KB |
testcase_70 | AC | 405 ms
62,824 KB |
testcase_71 | AC | 407 ms
63,380 KB |
testcase_72 | AC | 688 ms
65,368 KB |
testcase_73 | AC | 1,256 ms
69,892 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String[] first = br.readLine().split(" ", 2); Scanner sc = new Scanner(System.in); int n = Integer.parseInt(first[0]); int m = Integer.parseInt(first[1]); Order[] leftArr = new Order[m]; Order[] rightArr = new Order[m]; for (int i = 0; i < m; i++) { String[] line = br.readLine().split(" ", 3); Order or = new Order(i, Integer.parseInt(line[0]), Integer.parseInt(line[1]), line[2].charAt(0)); leftArr[i] = or; rightArr[i] = or; } Arrays.sort(leftArr, new Comparator<Order>() { public int compare(Order o1, Order o2) { return o1.left - o2.left; } }); Arrays.sort(rightArr, new Comparator<Order>() { public int compare(Order o1, Order o2) { return o1.right - o2.right; } }); 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]; int leftIdx = 0; int rightIdx = 0; for (int i = 1; i <= n; i++) { while(leftIdx < m && leftArr[leftIdx].left == i) { set.add(leftArr[leftIdx]); leftIdx++; } if (set.size() == 0) { continue; } counts[set.first().type]++; while (rightIdx < m && rightArr[rightIdx].right == i) { set.remove(rightArr[rightIdx]); rightIdx++; } } 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; } } }