結果

問題 No.447 ゆきこーだーの雨と雪 (2)
ユーザー crazybbb3crazybbb3
提出日時 2016-11-25 01:48:27
言語 Java
(openjdk 23)
結果
AC  
実行時間 304 ms / 2,000 ms
コード長 3,507 bytes
コンパイル時間 2,596 ms
コンパイル使用メモリ 87,164 KB
実行使用メモリ 47,872 KB
最終ジャッジ日時 2024-11-27 10:52:16
合計ジャッジ時間 8,972 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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();
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0