結果
問題 | No.447 ゆきこーだーの雨と雪 (2) |
ユーザー | crazybbb3 |
提出日時 | 2016-11-25 01:48:27 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 305 ms / 2,000 ms |
コード長 | 3,507 bytes |
コンパイル時間 | 3,007 ms |
コンパイル使用メモリ | 83,372 KB |
実行使用メモリ | 47,764 KB |
最終ジャッジ日時 | 2024-05-05 13:11:12 |
合計ジャッジ時間 | 9,415 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 89 ms
40,136 KB |
testcase_01 | AC | 83 ms
40,148 KB |
testcase_02 | AC | 80 ms
39,944 KB |
testcase_03 | AC | 181 ms
42,188 KB |
testcase_04 | AC | 181 ms
41,820 KB |
testcase_05 | AC | 237 ms
43,456 KB |
testcase_06 | AC | 276 ms
46,656 KB |
testcase_07 | AC | 223 ms
43,644 KB |
testcase_08 | AC | 218 ms
43,656 KB |
testcase_09 | AC | 264 ms
46,764 KB |
testcase_10 | AC | 165 ms
41,708 KB |
testcase_11 | AC | 198 ms
42,868 KB |
testcase_12 | AC | 216 ms
42,688 KB |
testcase_13 | AC | 251 ms
45,140 KB |
testcase_14 | AC | 265 ms
47,764 KB |
testcase_15 | AC | 211 ms
42,612 KB |
testcase_16 | AC | 179 ms
41,984 KB |
testcase_17 | AC | 190 ms
42,120 KB |
testcase_18 | AC | 132 ms
40,464 KB |
testcase_19 | AC | 305 ms
47,736 KB |
testcase_20 | AC | 271 ms
47,056 KB |
testcase_21 | AC | 201 ms
42,608 KB |
testcase_22 | AC | 180 ms
42,160 KB |
testcase_23 | AC | 209 ms
42,984 KB |
testcase_24 | AC | 261 ms
46,740 KB |
testcase_25 | AC | 278 ms
45,676 KB |
testcase_26 | AC | 231 ms
43,588 KB |
testcase_27 | AC | 226 ms
43,452 KB |
ソースコード
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Collections; import java.util.HashMap; import java.util.StringTokenizer; public class Main { static BufferedReader in; static PrintWriter out; static StringTokenizer tok; void solve() throws IOException { int n = ni(); int[] l = nia(n); int t = ni(); String[] name = new String[t]; int[] p = new int[t]; for (int i = 0; i < t; i++) { name[i] = ns(); p[i] = ns().charAt(0) - 'A'; } HashMap<String, Integer> idMap = new HashMap<>(); for (int i = 0; i < t; i++) { if (!idMap.containsKey(name[i])) { idMap.put(name[i], idMap.size()); } } int m = idMap.size(); int[][] score = new int[m][n]; int[] rank = new int[n]; int[] last = new int[m]; for (int i = 0; i < t; i++) { rank[p[i]]++; score[idMap.get(name[i])][p[i]] = 50 * l[p[i]] + (50 * l[p[i]] * 10) / (8 + 2 * rank[p[i]]); last[idMap.get(name[i])] = i; } ArrayList<Man> scoreList = new ArrayList<>(); for (String x : idMap.keySet()) { int sum = 0; for (int i = 0; i < n; i++) { sum += score[idMap.get(x)][i]; } scoreList.add(new Man(x, sum, last[idMap.get(x)])); } Collections.sort(scoreList); for (int i = 0; i < scoreList.size(); i++) { String nameTmp = scoreList.get(i).name; out.print(i + 1 + " " + nameTmp); for (int j = 0; j < n; j++) { out.print(" " + score[idMap.get(nameTmp)][j]); } out.println(" " + scoreList.get(i).sum); } } public class Man implements Comparable<Man> { String name; int sum; int last; public Man(String name, int sum, int last) { this.name = name; this.sum = sum; this.last = last; } public int compareTo(Man p) { return sum != p.sum ? p.sum - sum : last - p.last; } } String ns() throws IOException { while (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine(), " "); } return tok.nextToken(); } int ni() throws IOException { return Integer.parseInt(ns()); } long nl() throws IOException { return Long.parseLong(ns()); } double nd() throws IOException { return Double.parseDouble(ns()); } String[] nsa(int n) throws IOException { String[] res = new String[n]; for (int i = 0; i < n; i++) { res[i] = ns(); } return res; } int[] nia(int n) throws IOException { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = ni(); } return res; } long[] nla(int n) throws IOException { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nl(); } return res; } public static void main(String[] args) throws IOException { in = new BufferedReader(new InputStreamReader(System.in)); out = new PrintWriter(System.out); tok = new StringTokenizer(""); Main main = new Main(); main.solve(); out.close(); } }