結果

問題 No.447 ゆきこーだーの雨と雪 (2)
ユーザー uwiuwi
提出日時 2016-11-18 22:31:44
言語 Java21
(openjdk 21)
結果
AC  
実行時間 264 ms / 2,000 ms
コード長 4,268 bytes
コンパイル時間 4,433 ms
コンパイル使用メモリ 91,736 KB
実行使用メモリ 47,004 KB
最終ジャッジ日時 2024-05-04 17:47:52
合計ジャッジ時間 10,394 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
38,552 KB
testcase_01 AC 87 ms
38,244 KB
testcase_02 AC 79 ms
38,292 KB
testcase_03 AC 156 ms
41,232 KB
testcase_04 AC 139 ms
40,436 KB
testcase_05 AC 203 ms
43,000 KB
testcase_06 AC 236 ms
45,800 KB
testcase_07 AC 195 ms
42,564 KB
testcase_08 AC 210 ms
43,472 KB
testcase_09 AC 223 ms
45,456 KB
testcase_10 AC 139 ms
39,776 KB
testcase_11 AC 175 ms
41,196 KB
testcase_12 AC 192 ms
41,876 KB
testcase_13 AC 218 ms
43,832 KB
testcase_14 AC 231 ms
45,432 KB
testcase_15 AC 174 ms
41,352 KB
testcase_16 AC 153 ms
40,956 KB
testcase_17 AC 158 ms
40,700 KB
testcase_18 AC 107 ms
39,068 KB
testcase_19 AC 259 ms
46,240 KB
testcase_20 AC 226 ms
45,676 KB
testcase_21 AC 187 ms
41,672 KB
testcase_22 AC 155 ms
40,912 KB
testcase_23 AC 201 ms
42,088 KB
testcase_24 AC 237 ms
45,268 KB
testcase_25 AC 264 ms
47,004 KB
testcase_26 AC 212 ms
43,108 KB
testcase_27 AC 197 ms
42,236 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest161118;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.List;
import java.util.Map;

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] stars = na(n);
		int T = ni();
		int[] rank = new int[n];
		Arrays.fill(rank, 1);
		Map<String, Datum> map = new HashMap<>();
		for(int i = 0;i < T;i++){
			String name = ns();
			char pr = nc();
			if(!map.containsKey(name)){
				map.put(name, new Datum(name, new int[n], 0));
			}
			map.get(name).score[pr-'A'] = score(stars[pr-'A'], rank[pr-'A']++);
			map.get(name).last = i;
		}
		List<Datum> ds = new ArrayList<>(map.values());
		ds.forEach(d -> d.go());
		ds.sort((x,y) -> {
			if(x.sum != y.sum)return -(x.sum - y.sum);
			return x.last - y.last;
		});
		
		for(int i = 0;i < ds.size();i++){
			Datum d = ds.get(i);
			out.print(i+1);
			out.print(" " + d.name);
			for(int j = 0;j < n;j++){
				out.print(" " + d.score[j]);
			}
			out.println(" " + d.sum);
		}
	}
	
	static class Datum
	{
		public String name;
		public int[] score;
		public int sum;
		public int last;
		
		public Datum(String name, int[] score, int sum) {
			this.name = name;
			this.score = score;
			this.sum = sum;
		}
		
		public void go()
		{
			sum = Arrays.stream(score).sum();
		}
	}
	
	int score(int a, int b)
	{
		return 50*a+250*a/(4+b);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0