結果
問題 | No.447 ゆきこーだーの雨と雪 (2) |
ユーザー | htensai |
提出日時 | 2019-12-26 15:48:07 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 256 ms / 2,000 ms |
コード長 | 2,583 bytes |
コンパイル時間 | 2,440 ms |
コンパイル使用メモリ | 80,044 KB |
実行使用メモリ | 59,200 KB |
最終ジャッジ日時 | 2024-04-15 01:26:00 |
合計ジャッジ時間 | 9,219 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 124 ms
54,192 KB |
testcase_01 | AC | 123 ms
54,612 KB |
testcase_02 | AC | 126 ms
54,004 KB |
testcase_03 | AC | 193 ms
56,936 KB |
testcase_04 | AC | 202 ms
57,100 KB |
testcase_05 | AC | 231 ms
59,200 KB |
testcase_06 | AC | 248 ms
58,756 KB |
testcase_07 | AC | 239 ms
58,048 KB |
testcase_08 | AC | 218 ms
57,140 KB |
testcase_09 | AC | 256 ms
58,232 KB |
testcase_10 | AC | 190 ms
54,964 KB |
testcase_11 | AC | 218 ms
56,944 KB |
testcase_12 | AC | 233 ms
57,216 KB |
testcase_13 | AC | 247 ms
57,844 KB |
testcase_14 | AC | 247 ms
58,792 KB |
testcase_15 | AC | 213 ms
56,944 KB |
testcase_16 | AC | 186 ms
54,840 KB |
testcase_17 | AC | 206 ms
57,236 KB |
testcase_18 | AC | 175 ms
54,660 KB |
testcase_19 | AC | 252 ms
59,004 KB |
testcase_20 | AC | 251 ms
58,864 KB |
testcase_21 | AC | 190 ms
56,800 KB |
testcase_22 | AC | 205 ms
56,896 KB |
testcase_23 | AC | 230 ms
57,944 KB |
testcase_24 | AC | 238 ms
58,844 KB |
testcase_25 | AC | 244 ms
59,088 KB |
testcase_26 | AC | 235 ms
58,300 KB |
testcase_27 | AC | 222 ms
57,952 KB |
ソースコード
import java.util.*; public class Main { static int[] questions; public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); questions = new int[n]; for (int i = 0; i < n; i++) { questions[i] = sc.nextInt(); } int[] idxes = new int[n]; int t = sc.nextInt(); HashMap<String, Person> map = new HashMap<>(); for (int i = 0; i < t; i++) { String name = sc.next(); int idx = sc.next().charAt(0) - 'A'; Person p; if (map.containsKey(name)) { p = map.get(name); } else { p = new Person(name, n); map.put(name, p); } idxes[idx]++; p.add(idx, idxes[idx], i); } ArrayList<Person> col = new ArrayList(map.values()); for (Person p : col) { p.calc(); } Collections.sort(col); StringBuilder sb = new StringBuilder(); int num = 1; for (Person p : col) { sb.append(num).append(" ").append(p).append("\n"); num++; } System.out.print(sb); } static class Person implements Comparable<Person> { String name; int[] orders; int[] points; int total; int lastUpdate; public Person (String name, int size) { this.name = name; orders = new int[size]; points = new int[size]; } public void calc() { for (int i = 0; i < orders.length; i++) { if (orders[i] != 0) { points[i] = 50 * questions[i] + 500 * questions[i] / (8 + orders[i] * 2); total += points[i]; } } } public void add(int idx, int order, int term) { orders[idx] = order; lastUpdate = term; } public String toString() { StringBuilder sb = new StringBuilder(); sb.append(name).append(" "); for (int i = 0; i < points.length; i++) { sb.append(points[i]).append(" "); } sb.append(total); return sb.toString(); } public int compareTo(Person another) { if (total == another.total) { return lastUpdate - another.lastUpdate; } else { return another.total - total; } } } }